Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …110011000100111001001 |
3 | 21002012100111202011120222 |
4 | 131012221112120213021 |
5 | 230232000224310441 |
6 | 4130442054355425 |
7 | 264331614043022 |
oct | 35065126304711 |
9 | 7065314664528 |
10 | 2000001010121 |
11 | 7012174807a4 |
12 | 28374435bb75 |
13 | 1167a382908a |
14 | 6cb2ca73c49 |
15 | 3705812bd4b |
hex | 1d1a95989c9 |
2000001010121 has 8 divisors (see below), whose sum is σ = 2109400310400. Its totient is φ = 1891015318800.
The previous prime is 2000001010087. The next prime is 2000001010129. The reversal of 2000001010121 is 1210101000002.
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 2000001010121 - 226 = 1999933901257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000001010099 and 2000001010108.
It is not an unprimeable number, because it can be changed into a prime (2000001010129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103392305 + ... + 103411646.
It is an arithmetic number, because the mean of its divisors is an integer number (263675038800).
Almost surely, 22000001010121 is an apocalyptic number.
It is an amenable number.
2000001010121 is a deficient number, since it is larger than the sum of its proper divisors (109399300279).
2000001010121 is a wasteful number, since it uses less digits than its factorization.
2000001010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206804479.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 2000001010121 its reverse (1210101000002), we get a palindrome (3210102010123).
It can be divided in two parts, 200000 and 1010121, that added together give a palindrome (1210121).
The spelling of 2000001010121 in words is "two trillion, one million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •