Base | Representation |
---|---|
bin | 11001011101111101101001… |
… | …011000011010011111001010 |
3 | 112200121001221211100112002111 |
4 | 121131331221120122133022 |
5 | 104140133412322320020 |
6 | 1034120441301252534 |
7 | 32410320446563102 |
oct | 3135755130323712 |
9 | 480531854315074 |
10 | 112010220120010 |
11 | 327652a4180453 |
12 | 106903b810414a |
13 | 4a66698003204 |
14 | 1d93475c92202 |
15 | ce3999a7dd5a |
hex | 65df6961a7ca |
112010220120010 has 8 divisors (see below), whose sum is σ = 201618396216036. Its totient is φ = 44804088048000.
The previous prime is 112010220119953. The next prime is 112010220120011. The reversal of 112010220120010 is 10021022010211.
It can be written as a sum of positive squares in 2 ways, for example, as 111922244407561 + 87975712449 = 10579331^2 + 296607^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1120102201200102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112010220120011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5600511005991 + ... + 5600511006010.
Almost surely, 2112010220120010 is an apocalyptic number.
112010220120010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112010220120010 is a deficient number, since it is larger than the sum of its proper divisors (89608176096026).
112010220120010 is a wasteful number, since it uses less digits than its factorization.
112010220120010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11201022012008.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112010220120010 its reverse (10021022010211), we get a palindrome (122031242130221).
The spelling of 112010220120010 in words is "one hundred twelve trillion, ten billion, two hundred twenty million, one hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •