Base | Representation |
---|---|
bin | 1101101111010010011101… |
… | …10111011101100110111111 |
3 | 10221222020202210202212010011 |
4 | 12313221032313131212333 |
5 | 12424443412004401421 |
6 | 144131131401524051 |
7 | 6235516401233440 |
oct | 667511667354677 |
9 | 127866683685104 |
10 | 30212123122111 |
11 | 9698986968337 |
12 | 347b38aaa3627 |
13 | 13b1cb6270c58 |
14 | 7663bb5792c7 |
15 | 375d476de4e1 |
hex | 1b7a4eddd9bf |
30212123122111 has 12 divisors (see below), whose sum is σ = 36441057096912. Its totient is φ = 24533152608384.
The previous prime is 30212123122091. The next prime is 30212123122231. The reversal of 30212123122111 is 11122132121203.
It is a happy number.
It is not a de Polignac number, because 30212123122111 - 211 = 30212123120063 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30212123120111) 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 in 11 ways as a sum of consecutive naturals, for example, 5977861170 + ... + 5977866223.
It is an arithmetic number, because the mean of its divisors is an integer number (3036754758076).
Almost surely, 230212123122111 is an apocalyptic number.
30212123122111 is a deficient number, since it is larger than the sum of its proper divisors (6228933974801).
30212123122111 is a wasteful number, since it uses less digits than its factorization.
30212123122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11955727438 (or 11955727419 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 30212123122111 its reverse (11122132121203), we get a palindrome (41334255243314).
The spelling of 30212123122111 in words is "thirty trillion, two hundred twelve billion, one hundred twenty-three million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •