Base | Representation |
---|---|
bin | 11101000110110000100… |
… | …000011111011011011111 |
3 | 21002012122212201100221020 |
4 | 131012300200133123133 |
5 | 230232222000144444 |
6 | 4130502024335223 |
7 | 264334602560211 |
oct | 35066040373337 |
9 | 7065585640836 |
10 | 2000121099999 |
11 | 701279244030 |
12 | 283778614513 |
13 | 1167c2684b89 |
14 | 6cb409b45b1 |
15 | 3706394e119 |
hex | 1d1b081f6df |
2000121099999 has 32 divisors (see below), whose sum is σ = 2988296672256. Its totient is φ = 1179274389120.
The previous prime is 2000121099959. The next prime is 2000121100007. The reversal of 2000121099999 is 9999901210002.
It is not a de Polignac number, because 2000121099999 - 217 = 2000120968927 is a prime.
It is a super-2 number, since 2×20001210999992 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000121099959) 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 31 ways as a sum of consecutive naturals, for example, 9328669 + ... + 9540665.
It is an arithmetic number, because the mean of its divisors is an integer number (93384271008).
Almost surely, 22000121099999 is an apocalyptic number.
2000121099999 is a deficient number, since it is larger than the sum of its proper divisors (988175572257).
2000121099999 is a wasteful number, since it uses less digits than its factorization.
2000121099999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219775.
The product of its (nonzero) digits is 236196, while the sum is 51.
The spelling of 2000121099999 in words is "two trillion, one hundred twenty-one million, ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •