Base | Representation |
---|---|
bin | 11101011101111111001… |
… | …11010011010101001001 |
3 | 10120210112002201022122011 |
4 | 32232333213103111021 |
5 | 113042131202044414 |
6 | 2053052324055521 |
7 | 133103326360321 |
oct | 16567747232511 |
9 | 3523462638564 |
10 | 1012532065609 |
11 | 360459a55309 |
12 | 14429ab345a1 |
13 | 7463473168c |
14 | 370149a6281 |
15 | 1b511a85dc4 |
hex | ebbf9d3549 |
1012532065609 has 2 divisors, whose sum is σ = 1012532065610. Its totient is φ = 1012532065608.
The previous prime is 1012532065583. The next prime is 1012532065613. The reversal of 1012532065609 is 9065602352101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 751203558400 + 261328507209 = 866720^2 + 511203^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012532065609 - 217 = 1012531934537 is a prime.
It is not a weakly prime, because it can be changed into another prime (1012532062609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506266032804 + 506266032805.
It is an arithmetic number, because the mean of its divisors is an integer number (506266032805).
Almost surely, 21012532065609 is an apocalyptic number.
It is an amenable number.
1012532065609 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012532065609 is an equidigital number, since it uses as much as digits as its factorization.
1012532065609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 40.
The spelling of 1012532065609 in words is "one trillion, twelve billion, five hundred thirty-two million, sixty-five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •