Base | Representation |
---|---|
bin | 10010111100101000100… |
… | …010100111000000111011 |
3 | 11121110211110200001222121 |
4 | 102330220202213000323 |
5 | 132313102121031102 |
6 | 2434053402502111 |
7 | 163033100013655 |
oct | 22745042470073 |
9 | 4543743601877 |
10 | 1302055252027 |
11 | 462220277492 |
12 | 19041b804937 |
13 | 95a24b485ba |
14 | 4703c5076d5 |
15 | 23d0959db37 |
hex | 12f288a703b |
1302055252027 has 2 divisors, whose sum is σ = 1302055252028. Its totient is φ = 1302055252026.
The previous prime is 1302055252007. The next prime is 1302055252051. The reversal of 1302055252027 is 7202525502031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1302055252027 - 215 = 1302055219259 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1302055251983 and 1302055252001.
It is not a weakly prime, because it can be changed into another prime (1302055252007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651027626013 + 651027626014.
It is an arithmetic number, because the mean of its divisors is an integer number (651027626014).
Almost surely, 21302055252027 is an apocalyptic number.
1302055252027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302055252027 is an equidigital number, since it uses as much as digits as its factorization.
1302055252027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42000, while the sum is 34.
The spelling of 1302055252027 in words is "one trillion, three hundred two billion, fifty-five million, two hundred fifty-two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.424 sec. • engine limits •