Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …010010000000101100101000 |
3 | 112200121001122112012122112022 |
4 | 121131331202102000230220 |
5 | 104140133141324013000 |
6 | 1034120421404204012 |
7 | 32410314502231256 |
oct | 3135754222005450 |
9 | 480531575178468 |
10 | 112010101001000 |
11 | 32765242a10594 |
12 | 10690384239608 |
13 | 4a666794272a7 |
14 | 1d934641255d6 |
15 | ce398e39e585 |
hex | 65df62480b28 |
112010101001000 has 64 divisors (see below), whose sum is σ = 264698722089360. Its totient is φ = 44360436000000.
The previous prime is 112010101000939. The next prime is 112010101001047. The reversal of 112010101001000 is 100101010211.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 28243931508004 + 83766169492996 = 5314502^2 + 9152386^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 554404451 + ... + 554606450.
Almost surely, 2112010101001000 is an apocalyptic number.
112010101001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112010101001000 is an abundant number, since it is smaller than the sum of its proper divisors (152688621088360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112010101001000 is a wasteful number, since it uses less digits than its factorization.
112010101001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1109011023 (or 1109011009 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 112010101001000 its reverse (100101010211), we get a palindrome (112110202011211).
The spelling of 112010101001000 in words is "one hundred twelve trillion, ten billion, one hundred one million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •