Base | Representation |
---|---|
bin | 10111001100100111100000… |
… | …010010011001101100011101 |
3 | 111101020012221000220210120220 |
4 | 113030213200102121230131 |
5 | 101333012301000231414 |
6 | 1000552152043431553 |
7 | 30326566161000345 |
oct | 2714474022315435 |
9 | 441205830823526 |
10 | 102022121102109 |
11 | 2a56437a71842a |
12 | b5386a1b255b9 |
13 | 44c084c650a40 |
14 | 1b29c7b567d25 |
15 | bbdc6984cca9 |
hex | 5cc9e0499b1d |
102022121102109 has 16 divisors (see below), whose sum is σ = 146630339856000. Its totient is φ = 62724113286336.
The previous prime is 102022121102087. The next prime is 102022121102131. The reversal of 102022121102109 is 901201121220201.
It is an interprime number because it is at equal distance from previous prime (102022121102087) and next prime (102022121102131).
It is not a de Polignac number, because 102022121102109 - 211 = 102022121100061 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102022121102189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1223509209 + ... + 1223592590.
It is an arithmetic number, because the mean of its divisors is an integer number (9164396241000).
Almost surely, 2102022121102109 is an apocalyptic number.
It is an amenable number.
102022121102109 is a deficient number, since it is larger than the sum of its proper divisors (44608218753891).
102022121102109 is a wasteful number, since it uses less digits than its factorization.
102022121102109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2447102884.
The product of its (nonzero) digits is 288, while the sum is 24.
The spelling of 102022121102109 in words is "one hundred two trillion, twenty-two billion, one hundred twenty-one million, one hundred two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •