Base | Representation |
---|---|
bin | 11110010101010000000… |
… | …01110110111101111101 |
3 | 10200122002210022201120022 |
4 | 33022220001312331331 |
5 | 114033411443121323 |
6 | 2114440335301525 |
7 | 135203500365554 |
oct | 17125001667575 |
9 | 3618083281508 |
10 | 1042201145213 |
11 | 371aa4415a08 |
12 | 149b9b07a8a5 |
13 | 77382390a97 |
14 | 3862b0acd9b |
15 | 1c19b5e44c8 |
hex | f2a8076f7d |
1042201145213 has 2 divisors, whose sum is σ = 1042201145214. Its totient is φ = 1042201145212.
The previous prime is 1042201145177. The next prime is 1042201145221. The reversal of 1042201145213 is 3125411022401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 751234760644 + 290966384569 = 866738^2 + 539413^2 .
It is a cyclic number.
It is not a de Polignac number, because 1042201145213 - 218 = 1042200883069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1042201145243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521100572606 + 521100572607.
It is an arithmetic number, because the mean of its divisors is an integer number (521100572607).
Almost surely, 21042201145213 is an apocalyptic number.
It is an amenable number.
1042201145213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042201145213 is an equidigital number, since it uses as much as digits as its factorization.
1042201145213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 1042201145213 its reverse (3125411022401), we get a palindrome (4167612167614).
The spelling of 1042201145213 in words is "one trillion, forty-two billion, two hundred one million, one hundred forty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •