Base | Representation |
---|---|
bin | 1101101111100011010111… |
… | …11101010001101101101111 |
3 | 10222000010012110121221021022 |
4 | 12313301223331101231233 |
5 | 12430121004441320421 |
6 | 144135232250524355 |
7 | 6236260352032061 |
oct | 667615375215557 |
9 | 128003173557238 |
10 | 30221201120111 |
11 | 96a1815192621 |
12 | 34810a31366bb |
13 | 13b2b01c302c1 |
14 | 7669dd095731 |
15 | 3761c96767ab |
hex | 1b7c6bf51b6f |
30221201120111 has 2 divisors, whose sum is σ = 30221201120112. Its totient is φ = 30221201120110.
The previous prime is 30221201120107. The next prime is 30221201120129. The reversal of 30221201120111 is 11102110212203.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 30221201120111 - 22 = 30221201120107 is a prime.
It is a super-2 number, since 2×302212011201112 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30221201120111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30221201120911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15110600560055 + 15110600560056.
It is an arithmetic number, because the mean of its divisors is an integer number (15110600560056).
Almost surely, 230221201120111 is an apocalyptic number.
30221201120111 is a deficient number, since it is larger than the sum of its proper divisors (1).
30221201120111 is an equidigital number, since it uses as much as digits as its factorization.
30221201120111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 30221201120111 its reverse (11102110212203), we get a palindrome (41323311332314).
The spelling of 30221201120111 in words is "thirty trillion, two hundred twenty-one billion, two hundred one million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •