Base | Representation |
---|---|
bin | 1101101110111110000111… |
… | …10011110111111110010101 |
3 | 10221221012120120101121221112 |
4 | 12313133003303313332111 |
5 | 12424304024223321114 |
6 | 144122123450024405 |
7 | 6234651616112144 |
oct | 667370363677625 |
9 | 127835516347845 |
10 | 30201200213909 |
11 | 96942911a477a |
12 | 3479240a18105 |
13 | 13b0c652c906a |
14 | 765a62a1575b |
15 | 3759087cc13e |
hex | 1b77c3cf7f95 |
30201200213909 has 2 divisors, whose sum is σ = 30201200213910. Its totient is φ = 30201200213908.
The previous prime is 30201200213837. The next prime is 30201200213923. The reversal of 30201200213909 is 90931200210203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21436622200900 + 8764578013009 = 4629970^2 + 2960503^2 .
It is a cyclic number.
It is not a de Polignac number, because 30201200213909 - 224 = 30201183436693 is a prime.
It is a super-2 number, since 2×302012002139092 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30201200213929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100600106954 + 15100600106955.
It is an arithmetic number, because the mean of its divisors is an integer number (15100600106955).
Almost surely, 230201200213909 is an apocalyptic number.
It is an amenable number.
30201200213909 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201200213909 is an equidigital number, since it uses as much as digits as its factorization.
30201200213909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 30201200213909 in words is "thirty trillion, two hundred one billion, two hundred million, two hundred thirteen thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •