Base | Representation |
---|---|
bin | 1101101100000001101000… |
… | …11001111011000011110111 |
3 | 10221120112101110012020010002 |
4 | 12312000310121323003313 |
5 | 12421124310031133421 |
6 | 144003430445021515 |
7 | 6224440210502612 |
oct | 666006431730367 |
9 | 127515343166102 |
10 | 30100010021111 |
11 | 9655384a51168 |
12 | 346170055489b |
13 | 13a455a04a034 |
14 | 760bc3899179 |
15 | 372e84d42b0b |
hex | 1b603467b0f7 |
30100010021111 has 4 divisors (see below), whose sum is σ = 30101157282552. Its totient is φ = 30098862759672.
The previous prime is 30100010021089. The next prime is 30100010021119. The reversal of 30100010021111 is 11112001000103.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30100010021111 - 26 = 30100010021047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30100010021092 and 30100010021101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30100010021119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 573591365 + ... + 573643838.
It is an arithmetic number, because the mean of its divisors is an integer number (7525289320638).
Almost surely, 230100010021111 is an apocalyptic number.
30100010021111 is a deficient number, since it is larger than the sum of its proper divisors (1147261441).
30100010021111 is a wasteful number, since it uses less digits than its factorization.
30100010021111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1147261440.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 30100010021111 its reverse (11112001000103), we get a palindrome (41212011021214).
The spelling of 30100010021111 in words is "thirty trillion, one hundred billion, ten million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •