Base | Representation |
---|---|
bin | 10111001110000100101000… |
… | …101100000000010000010011 |
3 | 111101120210001010112012211221 |
4 | 113032010220230000100103 |
5 | 101341132100211133021 |
6 | 1001110130531345511 |
7 | 30340036222534066 |
oct | 2716045054002023 |
9 | 441523033465757 |
10 | 102122120021011 |
11 | 2a5a2825485262 |
12 | b553b4b452297 |
13 | 44ca0c7b7237c |
14 | 1b30a463c68dd |
15 | bc166d922241 |
hex | 5ce128b00413 |
102122120021011 has 8 divisors (see below), whose sum is σ = 103059393008000. Its totient is φ = 101184853812480.
The previous prime is 102122120020997. The next prime is 102122120021023. The reversal of 102122120021011 is 110120021221201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102122120021011 - 25 = 102122120020979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102122120021071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31555006 + ... + 34640476.
It is an arithmetic number, because the mean of its divisors is an integer number (12882424126000).
Almost surely, 2102122120021011 is an apocalyptic number.
102122120021011 is a deficient number, since it is larger than the sum of its proper divisors (937272986989).
102122120021011 is a wasteful number, since it uses less digits than its factorization.
102122120021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3389229.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102122120021011 its reverse (110120021221201), we get a palindrome (212242141242212).
The spelling of 102122120021011 in words is "one hundred two trillion, one hundred twenty-two billion, one hundred twenty million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •