Base | Representation |
---|---|
bin | 1101101110111110000111… |
… | …10011111001111110100101 |
3 | 10221221012120120102001012112 |
4 | 12313133003303321332211 |
5 | 12424304024224101432 |
6 | 144122123450130405 |
7 | 6234651616145111 |
oct | 667370363717645 |
9 | 127835516361175 |
10 | 30201200222117 |
11 | 96942911aa961 |
12 | 3479240a20a05 |
13 | 13b0c652cca12 |
14 | 765a62a18741 |
15 | 3759087ce7b2 |
hex | 1b77c3cf9fa5 |
30201200222117 has 2 divisors, whose sum is σ = 30201200222118. Its totient is φ = 30201200222116.
The previous prime is 30201200222071. The next prime is 30201200222173. The reversal of 30201200222117 is 71122200210203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28782430985476 + 1418769236641 = 5364926^2 + 1191121^2 .
It is a cyclic number.
It is not a de Polignac number, because 30201200222117 - 232 = 30196905254821 is a prime.
It is a super-2 number, since 2×302012002221172 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30201200222092 and 30201200222101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30201200222917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100600111058 + 15100600111059.
It is an arithmetic number, because the mean of its divisors is an integer number (15100600111059).
Almost surely, 230201200222117 is an apocalyptic number.
It is an amenable number.
30201200222117 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201200222117 is an equidigital number, since it uses as much as digits as its factorization.
30201200222117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 23.
The spelling of 30201200222117 in words is "thirty trillion, two hundred one billion, two hundred million, two hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •