Base | Representation |
---|---|
bin | 111100100010010101… |
… | …0111000101111000000 |
3 | 110102120000000202000000 |
4 | 1321010222320233000 |
5 | 4112220241041000 |
6 | 135415515000000 |
7 | 12251356135224 |
oct | 1710452705700 |
9 | 412500022000 |
10 | 130001112000 |
11 | 50151269641 |
12 | 21241139000 |
13 | c34a1a3a16 |
14 | 64136b8784 |
15 | 35aced3000 |
hex | 1e44ab8bc0 |
130001112000 has 392 divisors, whose sum is σ = 482722470672. Its totient is φ = 34665408000.
The previous prime is 130001111983. The next prime is 130001112011. The reversal of 130001112000 is 211100031.
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 pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 5820855 + ... + 5843145.
Almost surely, 2130001112000 is an apocalyptic number.
130001112000 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 130001112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (241361235336).
130001112000 is an abundant number, since it is smaller than the sum of its proper divisors (352721358672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130001112000 is an frugal number, since it uses more digits than its factorization.
130001112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22336 (or 22301 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 130001112000 its reverse (211100031), we get a palindrome (130212212031).
The spelling of 130001112000 in words is "one hundred thirty billion, one million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •