Base | Representation |
---|---|
bin | 110100001010001010… |
… | …1000010111011000100 |
3 | 101201010011222021110210 |
4 | 1220110111002323010 |
5 | 3313344103223022 |
6 | 123242355315420 |
7 | 11043501040650 |
oct | 1502425027304 |
9 | 351104867423 |
10 | 112010211012 |
11 | 43559931427 |
12 | 1985bbabb70 |
13 | a740b0ab8b |
14 | 55c8179a60 |
15 | 2da8825a0c |
hex | 1a14542ec4 |
112010211012 has 48 divisors (see below), whose sum is σ = 298928085120. Its totient is φ = 31977825792.
The previous prime is 112010211007. The next prime is 112010211017. The reversal of 112010211012 is 210112010211.
It is an interprime number because it is at equal distance from previous prime (112010211007) and next prime (112010211017).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (112010211017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 414837 + ... + 629372.
It is an arithmetic number, because the mean of its divisors is an integer number (6227668440).
Almost surely, 2112010211012 is an apocalyptic number.
112010211012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112010211012 is an abundant number, since it is smaller than the sum of its proper divisors (186917874108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112010211012 is a wasteful number, since it uses less digits than its factorization.
112010211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1045500 (or 1045498 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112010211012 its reverse (210112010211), we get a palindrome (322122221223).
The spelling of 112010211012 in words is "one hundred twelve billion, ten million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •