Base | Representation |
---|---|
bin | 11001011111011010101011… |
… | …010010011111100100001100 |
3 | 112200221121210022222212201220 |
4 | 121133122223102133210030 |
5 | 104143303001142041022 |
6 | 1034234401254403340 |
7 | 32420455016524425 |
oct | 3137325322374414 |
9 | 480847708885656 |
10 | 112110110112012 |
11 | 327a36a34a9951 |
12 | 106a7835060550 |
13 | 4a72c26aa6a5c |
14 | 1d9823047864c |
15 | ce63942d885c |
hex | 65f6ab49f90c |
112110110112012 has 24 divisors (see below), whose sum is σ = 261810636284736. Its totient is φ = 37338553938768.
The previous prime is 112110110111971. The next prime is 112110110112023. The reversal of 112110110112012 is 210211011011211.
It is a junction number, because it is equal to n+sod(n) for n = 112110110111982 and 112110110112000.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3935330818 + ... + 3935359305.
It is an arithmetic number, because the mean of its divisors is an integer number (10908776511864).
Almost surely, 2112110110112012 is an apocalyptic number.
112110110112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112110110112012 is an abundant number, since it is smaller than the sum of its proper divisors (149700526172724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110110112012 is a wasteful number, since it uses less digits than its factorization.
112110110112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7870691317 (or 7870691315 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 112110110112012 its reverse (210211011011211), we get a palindrome (322321121123223).
The spelling of 112110110112012 in words is "one hundred twelve trillion, one hundred ten billion, one hundred ten million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •