Base | Representation |
---|---|
bin | 10100101101011000110… |
… | …111110111110000000001 |
3 | 12001001100001011111110212 |
4 | 110231120313313300001 |
5 | 141304030023410012 |
6 | 3005435200203505 |
7 | 204550240514423 |
oct | 24553067676001 |
9 | 5031301144425 |
10 | 1423125216257 |
11 | 4a95a90a1568 |
12 | 1ab989909595 |
13 | a427a8c82a4 |
14 | 4cc459b0813 |
15 | 27043455b22 |
hex | 14b58df7c01 |
1423125216257 has 2 divisors, whose sum is σ = 1423125216258. Its totient is φ = 1423125216256.
The previous prime is 1423125216203. The next prime is 1423125216259. The reversal of 1423125216257 is 7526125213241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1390420663921 + 32704552336 = 1179161^2 + 180844^2 .
It is an emirp because it is prime and its reverse (7526125213241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1423125216257 - 212 = 1423125212161 is a prime.
It is a super-2 number, since 2×14231252162572 (a number of 25 digits) contains 22 as substring.
Together with 1423125216259, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1423125216259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 711562608128 + 711562608129.
It is an arithmetic number, because the mean of its divisors is an integer number (711562608129).
Almost surely, 21423125216257 is an apocalyptic number.
It is an amenable number.
1423125216257 is a deficient number, since it is larger than the sum of its proper divisors (1).
1423125216257 is an equidigital number, since it uses as much as digits as its factorization.
1423125216257 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 201600, while the sum is 41.
The spelling of 1423125216257 in words is "one trillion, four hundred twenty-three billion, one hundred twenty-five million, two hundred sixteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •