Base | Representation |
---|---|
bin | 1001010010010011101000… |
… | …0110101101101011101110 |
3 | 1100011002002021012220020211 |
4 | 2110210322012231223232 |
5 | 2314240302144213402 |
6 | 33414243304333034 |
7 | 2102441044625524 |
oct | 224447206555356 |
9 | 40132067186224 |
10 | 10210112101102 |
11 | 32870a2116471 |
12 | 118a955a7417a |
13 | 590a6a454674 |
14 | 27425a1d4314 |
15 | 12a8c601a4d7 |
hex | 9493a1adaee |
10210112101102 has 8 divisors (see below), whose sum is σ = 15315235244496. Its totient is φ = 5105033686272.
The previous prime is 10210112101093. The next prime is 10210112101121. The reversal of 10210112101102 is 20110121101201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×102101121011022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 10605523 + ... + 11528110.
It is an arithmetic number, because the mean of its divisors is an integer number (1914404405562).
Almost surely, 210210112101102 is an apocalyptic number.
10210112101102 is a deficient number, since it is larger than the sum of its proper divisors (5105123143394).
10210112101102 is a wasteful number, since it uses less digits than its factorization.
10210112101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22364282.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10210112101102 its reverse (20110121101201), we get a palindrome (30320233202303).
Subtracting 10210112101102 from its reverse (20110121101201), we obtain a palindrome (9900009000099).
The spelling of 10210112101102 in words is "ten trillion, two hundred ten billion, one hundred twelve million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •