Base | Representation |
---|---|
bin | 101010001101101… |
… | …0010110110100101 |
3 | 10122201021200010011 |
4 | 1110123102312211 |
5 | 10400102110003 |
6 | 352315130221 |
7 | 50046360223 |
oct | 12433226645 |
9 | 3581250104 |
10 | 1416441253 |
11 | 6675a9307 |
12 | 336443971 |
13 | 1975b7126 |
14 | d6191b13 |
15 | 8454146d |
hex | 546d2da5 |
1416441253 has 2 divisors, whose sum is σ = 1416441254. Its totient is φ = 1416441252.
The previous prime is 1416441211. The next prime is 1416441259. The reversal of 1416441253 is 3521446141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 790340769 + 626100484 = 28113^2 + 25022^2 .
It is an emirp because it is prime and its reverse (3521446141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1416441253 - 221 = 1414344101 is a prime.
It is a super-3 number, since 3×14164412533 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1416441259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 708220626 + 708220627.
It is an arithmetic number, because the mean of its divisors is an integer number (708220627).
Almost surely, 21416441253 is an apocalyptic number.
It is an amenable number.
1416441253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1416441253 is an equidigital number, since it uses as much as digits as its factorization.
1416441253 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11520, while the sum is 31.
The square root of 1416441253 is about 37635.6380708498. The cubic root of 1416441253 is about 1123.0511121909.
Adding to 1416441253 its reverse (3521446141), we get a palindrome (4937887394).
The spelling of 1416441253 in words is "one billion, four hundred sixteen million, four hundred forty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •