Base | Representation |
---|---|
bin | 1101101111010010011101… |
… | …11000001011100100110101 |
3 | 10221222020202211010102101102 |
4 | 12313221032320023210311 |
5 | 12424443412031413024 |
6 | 144131131405535445 |
7 | 6235516402646366 |
oct | 667511670134465 |
9 | 127866684112342 |
10 | 30212123310389 |
11 | 9698986a86839 |
12 | 347b38ab74585 |
13 | 13b1cb6308867 |
14 | 7663bb5c7b6d |
15 | 375d4772a1ae |
hex | 1b7a4ee0b935 |
30212123310389 has 2 divisors, whose sum is σ = 30212123310390. Its totient is φ = 30212123310388.
The previous prime is 30212123310301. The next prime is 30212123310407. The reversal of 30212123310389 is 98301332121203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19616173870225 + 10595949440164 = 4429015^2 + 3255142^2 .
It is an emirp because it is prime and its reverse (98301332121203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30212123310389 - 228 = 30211854874933 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30212123390389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15106061655194 + 15106061655195.
It is an arithmetic number, because the mean of its divisors is an integer number (15106061655195).
Almost surely, 230212123310389 is an apocalyptic number.
It is an amenable number.
30212123310389 is a deficient number, since it is larger than the sum of its proper divisors (1).
30212123310389 is an equidigital number, since it uses as much as digits as its factorization.
30212123310389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 38.
The spelling of 30212123310389 in words is "thirty trillion, two hundred twelve billion, one hundred twenty-three million, three hundred ten thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •