Base | Representation |
---|---|
bin | 1001010010011011000111… |
… | …1010101011001100011110 |
3 | 1100011021021100121001210100 |
4 | 2110212301322223030132 |
5 | 2314303411241223402 |
6 | 33415214552121530 |
7 | 2102541623365530 |
oct | 224466172531436 |
9 | 40137240531710 |
10 | 10212122211102 |
11 | 3287a338388a9 |
12 | 118b2170962a6 |
13 | 590ccaa2b676 |
14 | 2743ab161850 |
15 | 12a99272871c |
hex | 949b1eab31e |
10212122211102 has 48 divisors (see below), whose sum is σ = 25537527711072. Its totient is φ = 2888860593600.
The previous prime is 10212122211089. The next prime is 10212122211103. The reversal of 10212122211102 is 20111222121201.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212122211103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 401217913 + ... + 401243364.
It is an arithmetic number, because the mean of its divisors is an integer number (532031827314).
Almost surely, 210212122211102 is an apocalyptic number.
10212122211102 is an abundant number, since it is smaller than the sum of its proper divisors (15325405499970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212122211102 is a wasteful number, since it uses less digits than its factorization.
10212122211102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802461393 (or 802461390 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10212122211102 its reverse (20111222121201), we get a palindrome (30323344332303).
The spelling of 10212122211102 in words is "ten trillion, two hundred twelve billion, one hundred twenty-two million, two hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •