Base | Representation |
---|---|
bin | 110100001001111011… |
… | …0000111001011110000 |
3 | 101201002121201022000000 |
4 | 1220103312013023300 |
5 | 3313340014231000 |
6 | 123241505430000 |
7 | 11043342105345 |
oct | 1502366071360 |
9 | 351077638000 |
10 | 112002102000 |
11 | 435552a2a68 |
12 | 1985933b300 |
13 | a73c22bc49 |
14 | 55c70687cc |
15 | 2da7c73000 |
hex | 1a13d872f0 |
112002102000 has 280 divisors, whose sum is σ = 406051161360. Its totient is φ = 29866838400.
The previous prime is 112002101999. The next prime is 112002102049. The reversal of 112002102000 is 201200211.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 1419591 + ... + 1496409.
Almost surely, 2112002102000 is an apocalyptic number.
112002102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112002102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203025580680).
112002102000 is an abundant number, since it is smaller than the sum of its proper divisors (294049059360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112002102000 is an frugal number, since it uses more digits than its factorization.
112002102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76860 (or 76829 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 112002102000 its reverse (201200211), we get a palindrome (112203302211).
The spelling of 112002102000 in words is "one hundred twelve billion, two million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •