Base | Representation |
---|---|
bin | 10111001101111001100010… |
… | …110111100010100111101111 |
3 | 111101112122022012000112201212 |
4 | 113031321202313202213233 |
5 | 101340433203033100444 |
6 | 1001100441120425035 |
7 | 30336135136444331 |
oct | 2715714267424757 |
9 | 441478265015655 |
10 | 102110211221999 |
11 | 2a598774255302 |
12 | b55178717817b |
13 | 44c8c4a890336 |
14 | 1b30236949451 |
15 | bc11c31b919e |
hex | 5cde62de29ef |
102110211221999 has 2 divisors, whose sum is σ = 102110211222000. Its totient is φ = 102110211221998.
The previous prime is 102110211221989. The next prime is 102110211222013. The reversal of 102110211221999 is 999122112011201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102110211221999 - 216 = 102110211156463 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102110211221989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055105610999 + 51055105611000.
It is an arithmetic number, because the mean of its divisors is an integer number (51055105611000).
Almost surely, 2102110211221999 is an apocalyptic number.
102110211221999 is a deficient number, since it is larger than the sum of its proper divisors (1).
102110211221999 is an equidigital number, since it uses as much as digits as its factorization.
102110211221999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 41.
The spelling of 102110211221999 in words is "one hundred two trillion, one hundred ten billion, two hundred eleven million, two hundred twenty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •