Base | Representation |
---|---|
bin | 101111100000011111… |
… | …1001000000000000001 |
3 | 100202100002102122202212 |
4 | 1133000333020000001 |
5 | 3132420114133441 |
6 | 114511313551505 |
7 | 10241125604546 |
oct | 1370077100001 |
9 | 322302378685 |
10 | 102022021121 |
11 | 3a2a3853539 |
12 | 17932b75595 |
13 | 980b6c7147 |
14 | 4d1b80cbcd |
15 | 29c19ebeeb |
hex | 17c0fc8001 |
102022021121 has 8 divisors (see below), whose sum is σ = 108454886400. Its totient is φ = 95695484400.
The previous prime is 102022021067. The next prime is 102022021181. The reversal of 102022021121 is 121120220201.
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 102022021121 - 230 = 100948279297 is a prime.
It is a super-2 number, since 2×1020220211212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102022021096 and 102022021105.
It is not an unprimeable number, because it can be changed into a prime (102022021181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26580161 + ... + 26583998.
It is an arithmetic number, because the mean of its divisors is an integer number (13556860800).
Almost surely, 2102022021121 is an apocalyptic number.
It is an amenable number.
102022021121 is a deficient number, since it is larger than the sum of its proper divisors (6432865279).
102022021121 is a wasteful number, since it uses less digits than its factorization.
102022021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53164279.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102022021121 its reverse (121120220201), we get a palindrome (223142241322).
The spelling of 102022021121 in words is "one hundred two billion, twenty-two million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.271 sec. • engine limits •