Base | Representation |
---|---|
bin | 110100010000000111… |
… | …1111110110011011010 |
3 | 101201122010022021112002 |
4 | 1220200033332303122 |
5 | 3314301303210020 |
6 | 123314302121002 |
7 | 11051450022263 |
oct | 1504017766332 |
9 | 351563267462 |
10 | 112210210010 |
11 | 43651813658 |
12 | 198b6b80162 |
13 | a773394892 |
14 | 560695b96a |
15 | 2dbb17e975 |
hex | 1a203fecda |
112210210010 has 8 divisors (see below), whose sum is σ = 201978378036. Its totient is φ = 44884084000.
The previous prime is 112210210001. The next prime is 112210210103. The reversal of 112210210010 is 10012012211.
112210210010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 108381199369 + 3829010641 = 329213^2 + 61879^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1122102100102 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112210209973 and 112210210000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5610510491 + ... + 5610510510.
Almost surely, 2112210210010 is an apocalyptic number.
112210210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112210210010 is a deficient number, since it is larger than the sum of its proper divisors (89768168026).
112210210010 is a wasteful number, since it uses less digits than its factorization.
112210210010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11221021008.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112210210010 its reverse (10012012211), we get a palindrome (122222222221).
The spelling of 112210210010 in words is "one hundred twelve billion, two hundred ten million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •