Base | Representation |
---|---|
bin | 11001011111100011111001… |
… | …011111001111011000000010 |
3 | 112200222120100102011110120211 |
4 | 121133203321133033120002 |
5 | 104143433241033323020 |
6 | 1034243120014424334 |
7 | 32421255263343553 |
oct | 3137437137173002 |
9 | 480876312143524 |
10 | 112120012011010 |
11 | 327a79148aa153 |
12 | 106a97392020aa |
13 | 4a73b44366ba3 |
14 | 1d988cd58232a |
15 | ce677376985a |
hex | 65f8f97cf602 |
112120012011010 has 8 divisors (see below), whose sum is σ = 201816021619836. Its totient is φ = 44848004804400.
The previous prime is 112120012010987. The next prime is 112120012011011. The reversal of 112120012011010 is 10110210021211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 90628248492769 + 21491763518241 = 9519887^2 + 4635921^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1121200120110102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112120012011011) 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, 5606000600541 + ... + 5606000600560.
Almost surely, 2112120012011010 is an apocalyptic number.
112120012011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112120012011010 is a deficient number, since it is larger than the sum of its proper divisors (89696009608826).
112120012011010 is a wasteful number, since it uses less digits than its factorization.
112120012011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11212001201108.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112120012011010 its reverse (10110210021211), we get a palindrome (122230222032221).
The spelling of 112120012011010 in words is "one hundred twelve trillion, one hundred twenty billion, twelve million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •