Base | Representation |
---|---|
bin | 111100100010010011… |
… | …0101110101001100000 |
3 | 110102112220222100221210 |
4 | 1321010212232221200 |
5 | 4112220001201422 |
6 | 135415435350120 |
7 | 12251343645552 |
oct | 1710446565140 |
9 | 412486870853 |
10 | 130000022112 |
11 | 50150694804 |
12 | 212408b2340 |
13 | c349bb190c |
14 | 64134b34d2 |
15 | 35acd6a10c |
hex | 1e449aea60 |
130000022112 has 48 divisors (see below), whose sum is σ = 341284088880. Its totient is φ = 43329019392.
The previous prime is 130000022093. The next prime is 130000022177. The reversal of 130000022112 is 211220000031.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (12).
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 7 ways as a sum of consecutive naturals, for example, 985198 + ... + 1109330.
It is an arithmetic number, because the mean of its divisors is an integer number (7110085185).
Almost surely, 2130000022112 is an apocalyptic number.
130000022112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130000022112 is an abundant number, since it is smaller than the sum of its proper divisors (211284066768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130000022112 is a wasteful number, since it uses less digits than its factorization.
130000022112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135055 (or 135047 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 130000022112 its reverse (211220000031), we get a palindrome (341220022143).
The spelling of 130000022112 in words is "one hundred thirty billion, twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •