Base | Representation |
---|---|
bin | 101111100000011111… |
… | …1000011011000100011 |
3 | 100202100002101200211111 |
4 | 1133000333003120203 |
5 | 3132420113032321 |
6 | 114511313324151 |
7 | 10241125465453 |
oct | 1370077033043 |
9 | 322302350744 |
10 | 102022002211 |
11 | 3a2a3840308 |
12 | 17932b66657 |
13 | 980b6bb65c |
14 | 4d1b805d63 |
15 | 29c19e65e1 |
hex | 17c0fc3623 |
102022002211 has 8 divisors (see below), whose sum is σ = 102170147040. Its totient is φ = 101873913408.
The previous prime is 102022002193. The next prime is 102022002223. The reversal of 102022002211 is 112200220201.
It is a happy number.
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 102022002211 - 29 = 102022001699 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102022002191 and 102022002200.
It is not an unprimeable number, because it can be changed into a prime (102022002241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4784305 + ... + 4805581.
It is an arithmetic number, because the mean of its divisors is an integer number (12771268380).
Almost surely, 2102022002211 is an apocalyptic number.
102022002211 is a deficient number, since it is larger than the sum of its proper divisors (148144829).
102022002211 is an equidigital number, since it uses as much as digits as its factorization.
102022002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28013.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102022002211 its reverse (112200220201), we get a palindrome (214222222412).
The spelling of 102022002211 in words is "one hundred two billion, twenty-two million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •