Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0101101110000100000 |
3 | 101201002122000022201212 |
4 | 1220103312231300200 |
5 | 3313340034310000 |
6 | 123241513045252 |
7 | 11043343334111 |
oct | 1502366556040 |
9 | 351078008655 |
10 | 112002260000 |
11 | 435553a0744 |
12 | 198593b6828 |
13 | a73c285b37 |
14 | 55c70aa208 |
15 | 2da7ca4c35 |
hex | 1a13dadc20 |
112002260000 has 60 divisors (see below), whose sum is σ = 275542409142. Its totient is φ = 44800896000.
The previous prime is 112002259981. The next prime is 112002260009. The reversal of 112002260000 is 62200211.
It can be written as a sum of positive squares in 5 ways, for example, as 16578107536 + 95424152464 = 128756^2 + 308908^2 .
It is not an unprimeable number, because it can be changed into a prime (112002260009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2780057 + ... + 2820056.
Almost surely, 2112002260000 is an apocalyptic number.
112002260000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112002260000 is an abundant number, since it is smaller than the sum of its proper divisors (163540149142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112002260000 is an frugal number, since it uses more digits than its factorization.
112002260000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5600143 (or 5600120 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 112002260000 its reverse (62200211), we get a palindrome (112064460211).
The spelling of 112002260000 in words is "one hundred twelve billion, two million, two hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •