Base | Representation |
---|---|
bin | 10111001100011101010110… |
… | …100001111111110010111101 |
3 | 111101012011210022120102122212 |
4 | 113030131112201333302331 |
5 | 101332322434304444213 |
6 | 1000543150231150205 |
7 | 30326032062106346 |
oct | 2714352641776275 |
9 | 441164708512585 |
10 | 102011219999933 |
11 | 2a55a796298a82 |
12 | b53655b215365 |
13 | 44bc80307231a |
14 | 1b2952587d0cd |
15 | bbd82c7e69a8 |
hex | 5cc75687fcbd |
102011219999933 has 2 divisors, whose sum is σ = 102011219999934. Its totient is φ = 102011219999932.
The previous prime is 102011219999861. The next prime is 102011220000023. The reversal of 102011219999933 is 339999912110201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86734707043609 + 15276512956324 = 9313147^2 + 3908518^2 .
It is a cyclic number.
It is not a de Polignac number, because 102011219999933 - 214 = 102011219983549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011219929933) 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, 51005609999966 + 51005609999967.
It is an arithmetic number, because the mean of its divisors is an integer number (51005609999967).
Almost surely, 2102011219999933 is an apocalyptic number.
It is an amenable number.
102011219999933 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011219999933 is an equidigital number, since it uses as much as digits as its factorization.
102011219999933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2125764, while the sum is 59.
The spelling of 102011219999933 in words is "one hundred two trillion, eleven billion, two hundred nineteen million, nine hundred ninety-nine thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •