Base | Representation |
---|---|
bin | 101111100110001010… |
… | …0101001000110110011 |
3 | 100202211100022022102000 |
4 | 1133030110221012303 |
5 | 3133312311223443 |
6 | 114542230225043 |
7 | 10245625313421 |
oct | 1371424510663 |
9 | 322740268360 |
10 | 102212211123 |
11 | 3a391146060 |
12 | 179867b5183 |
13 | 983bc281c9 |
14 | 4d38b9a111 |
15 | 29d35698d3 |
hex | 17cc5291b3 |
102212211123 has 32 divisors (see below), whose sum is σ = 165212889600. Its totient is φ = 61938756000.
The previous prime is 102212211089. The next prime is 102212211217. The reversal of 102212211123 is 321112212201.
It is not a de Polignac number, because 102212211123 - 216 = 102212145587 is a prime.
It is a super-2 number, since 2×1022122111232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102212211096 and 102212211105.
It is not an unprimeable number, because it can be changed into a prime (102212211823) 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 31 ways as a sum of consecutive naturals, for example, 2923218 + ... + 2957976.
It is an arithmetic number, because the mean of its divisors is an integer number (5162902800).
Almost surely, 2102212211123 is an apocalyptic number.
102212211123 is a deficient number, since it is larger than the sum of its proper divisors (63000678477).
102212211123 is a wasteful number, since it uses less digits than its factorization.
102212211123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44680 (or 44674 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 102212211123 its reverse (321112212201), we get a palindrome (423324423324).
The spelling of 102212211123 in words is "one hundred two billion, two hundred twelve million, two hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •