Base | Representation |
---|---|
bin | 101111100110011101… |
… | …0000011110110110101 |
3 | 100202212000202122200112 |
4 | 1133030322003312311 |
5 | 3133322314120041 |
6 | 114543220352405 |
7 | 10246104555662 |
oct | 1371472036665 |
9 | 322760678615 |
10 | 102222020021 |
11 | 3a396735690 |
12 | 17989b45705 |
13 | 9840c80aa4 |
14 | 4d3a1d0a69 |
15 | 29d4355deb |
hex | 17cce83db5 |
102222020021 has 8 divisors (see below), whose sum is σ = 111517341600. Its totient is φ = 92927100240.
The previous prime is 102222020011. The next prime is 102222020071. The reversal of 102222020021 is 120020222201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102222020021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102222019978 and 102222020005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102222020011) 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, 730190 + ... + 858848.
It is an arithmetic number, because the mean of its divisors is an integer number (13939667700).
Almost surely, 2102222020021 is an apocalyptic number.
102222020021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102222020021 is a deficient number, since it is larger than the sum of its proper divisors (9295321579).
102222020021 is a wasteful number, since it uses less digits than its factorization.
102222020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200899.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 102222020021 its reverse (120020222201), we get a palindrome (222242242222).
The spelling of 102222020021 in words is "one hundred two billion, two hundred twenty-two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •