Base | Representation |
---|---|
bin | 11101000110110111101… |
… | …10111000111100101011 |
3 | 10112121111011010110202101 |
4 | 32203123312320330223 |
5 | 112341221434341021 |
6 | 2043241012114231 |
7 | 132153634223512 |
oct | 16433366707453 |
9 | 3477434113671 |
10 | 1000121012011 |
11 | 356170269020 |
12 | 1419b6605977 |
13 | 73407388294 |
14 | 36598547679 |
15 | 1b0371bba91 |
hex | e8dbdb8f2b |
1000121012011 has 8 divisors (see below), whose sum is σ = 1091190220848. Its totient is φ = 909076656000.
The previous prime is 1000121011997. The next prime is 1000121012063. The reversal of 1000121012011 is 1102101210001.
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 1000121012011 - 25 = 1000121011979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000121012911) 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, 6129010 + ... + 6290071.
It is an arithmetic number, because the mean of its divisors is an integer number (136398777606).
Almost surely, 21000121012011 is an apocalyptic number.
1000121012011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1000121012011 is a deficient number, since it is larger than the sum of its proper divisors (91069208837).
1000121012011 is a wasteful number, since it uses less digits than its factorization.
1000121012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12426413.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1000121012011 its reverse (1102101210001), we get a palindrome (2102222222012).
It can be divided in two parts, 10001 and 21012011, that added together give a palindrome (21022012).
The spelling of 1000121012011 in words is "one trillion, one hundred twenty-one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •