Base | Representation |
---|---|
bin | 1101101111010010100110… |
… | …11101100111000001100011 |
3 | 10221222020222011212101122100 |
4 | 12313221103131213001203 |
5 | 12424444041224343021 |
6 | 144131143154341443 |
7 | 6235521325525641 |
oct | 667512335470143 |
9 | 127866864771570 |
10 | 30212200231011 |
11 | 9698a164443a7 |
12 | 347b3b088a883 |
13 | 13b1cc922b416 |
14 | 7663c78cc191 |
15 | 375d4e371626 |
hex | 1b7a53767063 |
30212200231011 has 24 divisors (see below), whose sum is σ = 46683254230704. Its totient is φ = 18761245009920.
The previous prime is 30212200231007. The next prime is 30212200231091. The reversal of 30212200231011 is 11013200221203.
30212200231011 is a `hidden beast` number, since 302 + 122 + 0 + 0 + 231 + 0 + 11 = 666.
It is not a de Polignac number, because 30212200231011 - 22 = 30212200231007 is a prime.
It is a super-2 number, since 2×302122002310112 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30212200231091) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1017847845 + ... + 1017877526.
It is an arithmetic number, because the mean of its divisors is an integer number (1945135592946).
Almost surely, 230212200231011 is an apocalyptic number.
30212200231011 is a deficient number, since it is larger than the sum of its proper divisors (16471053999693).
30212200231011 is a wasteful number, since it uses less digits than its factorization.
30212200231011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2035725491 (or 2035725488 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 30212200231011 its reverse (11013200221203), we get a palindrome (41225400452214).
The spelling of 30212200231011 in words is "thirty trillion, two hundred twelve billion, two hundred million, two hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •