Base | Representation |
---|---|
bin | 101111100110001010… |
… | …0101001001000001011 |
3 | 100202211100022022112021 |
4 | 1133030110221020023 |
5 | 3133312311224321 |
6 | 114542230225311 |
7 | 10245625313605 |
oct | 1371424511013 |
9 | 322740268467 |
10 | 102212211211 |
11 | 3a391146130 |
12 | 179867b5237 |
13 | 983bc28266 |
14 | 4d38b9a175 |
15 | 29d3569941 |
hex | 17cc52920b |
102212211211 has 32 divisors (see below), whose sum is σ = 115196981760. Its totient is φ = 89900928000.
The previous prime is 102212211089. The next prime is 102212211217. The reversal of 102212211211 is 112112212201.
It is a cyclic number.
It is not a de Polignac number, because 102212211211 - 29 = 102212210699 is a prime.
It is a super-2 number, since 2×1022122112112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102212211217) 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 31 ways as a sum of consecutive naturals, for example, 12232411 + ... + 12240763.
It is an arithmetic number, because the mean of its divisors is an integer number (3599905680).
Almost surely, 2102212211211 is an apocalyptic number.
102212211211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102212211211 is a deficient number, since it is larger than the sum of its proper divisors (12984770549).
102212211211 is a wasteful number, since it uses less digits than its factorization.
102212211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8707.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102212211211 its reverse (112112212201), we get a palindrome (214324423412).
The spelling of 102212211211 in words is "one hundred two billion, two hundred twelve million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •