Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …01001001100001111111111 |
3 | 2121211002121212021200121021 |
4 | 10203003211021030033333 |
5 | 10110144440300401421 |
6 | 110312232514045011 |
7 | 4133016452625403 |
oct | 443034511141777 |
9 | 77732555250537 |
10 | 20001212122111 |
11 | 64115148a3350 |
12 | 22b0451579767 |
13 | b2114c46095c |
14 | 4d20c7225103 |
15 | 24a4264b8341 |
hex | 1230e524c3ff |
20001212122111 has 8 divisors (see below), whose sum is σ = 21820868811648. Its totient is φ = 18181782879000.
The previous prime is 20001212122037. The next prime is 20001212122117. The reversal of 20001212122111 is 11122121210002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20001212122111 - 221 = 20001210024959 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 (20001212122117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56677705 + ... + 57029506.
It is an arithmetic number, because the mean of its divisors is an integer number (2727608601456).
Almost surely, 220001212122111 is an apocalyptic number.
20001212122111 is a deficient number, since it is larger than the sum of its proper divisors (1819656689537).
20001212122111 is a wasteful number, since it uses less digits than its factorization.
20001212122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113723213.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20001212122111 its reverse (11122121210002), we get a palindrome (31123333332113).
The spelling of 20001212122111 in words is "twenty trillion, one billion, two hundred twelve million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •