Base | Representation |
---|---|
bin | 11101000110110000100… |
… | …000001001111100101011 |
3 | 21002012122212112220020102 |
4 | 131012300200021330223 |
5 | 230232221434341021 |
6 | 4130502022420015 |
7 | 264334602042533 |
oct | 35066040117453 |
9 | 7065585486212 |
10 | 2000121012011 |
11 | 701279193a11 |
12 | 28377859160b |
13 | 1167c2653b05 |
14 | 6cb409904c3 |
15 | 3706393300b |
hex | 1d1b0809f2b |
2000121012011 has 8 divisors (see below), whose sum is σ = 2060753569344. Its totient is φ = 1940241654400.
The previous prime is 2000121011963. The next prime is 2000121012023. The reversal of 2000121012011 is 1102101210002.
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 2000121012011 - 218 = 2000120749867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000121011983 and 2000121012001.
It is not an unprimeable number, because it can be changed into a prime (2000121012511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 188294540 + ... + 188305161.
It is an arithmetic number, because the mean of its divisors is an integer number (257594196168).
Almost surely, 22000121012011 is an apocalyptic number.
2000121012011 is a deficient number, since it is larger than the sum of its proper divisors (60632557333).
2000121012011 is a wasteful number, since it uses less digits than its factorization.
2000121012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376599861.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2000121012011 its reverse (1102101210002), we get a palindrome (3102222222013).
The spelling of 2000121012011 in words is "two trillion, one hundred twenty-one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •