Base | Representation |
---|---|
bin | 11001000011110011001101… |
… | …000111100101001100011111 |
3 | 112110020012012211110112010222 |
4 | 121003303031013211030133 |
5 | 103421204243321210444 |
6 | 1030222455503151555 |
7 | 32133401406046604 |
oct | 3103631507451437 |
9 | 473205184415128 |
10 | 110212302131999 |
11 | 32131858363231 |
12 | 1043ba70ba55bb |
13 | 4965c8b21b482 |
14 | 1d30437c0a6ab |
15 | cb1d1cbd7eee |
hex | 643ccd1e531f |
110212302131999 has 2 divisors, whose sum is σ = 110212302132000. Its totient is φ = 110212302131998.
The previous prime is 110212302131969. The next prime is 110212302132061. The reversal of 110212302131999 is 999131203212011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110212302131999 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110212302131969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55106151065999 + 55106151066000.
It is an arithmetic number, because the mean of its divisors is an integer number (55106151066000).
Almost surely, 2110212302131999 is an apocalyptic number.
110212302131999 is a deficient number, since it is larger than the sum of its proper divisors (1).
110212302131999 is an equidigital number, since it uses as much as digits as its factorization.
110212302131999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 44.
The spelling of 110212302131999 in words is "one hundred ten trillion, two hundred twelve billion, three hundred two million, one hundred thirty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •