Base | Representation |
---|---|
bin | 11101000110110000101… |
… | …000001100111010110001 |
3 | 21002012200000112001200022 |
4 | 131012300220030322301 |
5 | 230232223004340304 |
6 | 4130502135533225 |
7 | 264334626006254 |
oct | 35066050147261 |
9 | 7065600461608 |
10 | 2000123121329 |
11 | 70127a3a4753 |
12 | 28377922a215 |
13 | 1167c2c11c28 |
14 | 6cb40d7d09b |
15 | 37063becebe |
hex | 1d1b0a0ceb1 |
2000123121329 has 2 divisors, whose sum is σ = 2000123121330. Its totient is φ = 2000123121328.
The previous prime is 2000123121319. The next prime is 2000123121377. The reversal of 2000123121329 is 9231213210002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1689539831329 + 310583290000 = 1299823^2 + 557300^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000123121329 - 224 = 2000106344113 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2000123121298 and 2000123121307.
It is not a weakly prime, because it can be changed into another prime (2000123121319) 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 as a sum of consecutive naturals, namely, 1000061560664 + 1000061560665.
It is an arithmetic number, because the mean of its divisors is an integer number (1000061560665).
Almost surely, 22000123121329 is an apocalyptic number.
It is an amenable number.
2000123121329 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000123121329 is an equidigital number, since it uses as much as digits as its factorization.
2000123121329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 2000123121329 in words is "two trillion, one hundred twenty-three million, one hundred twenty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •