Base | Representation |
---|---|
bin | 11101100100000011100111… |
… | …011001100011111000110000 |
3 | 122001100220021021000101121201 |
4 | 131210003213121203320300 |
5 | 114020231234322101000 |
6 | 1140310514502500544 |
7 | 36246500602503235 |
oct | 3544034731437060 |
9 | 561326237011551 |
10 | 130021132222000 |
11 | 3847971a54a408 |
12 | 126bab72134754 |
13 | 5771c2b6b2c66 |
14 | 24170b09ad78c |
15 | 100723491296a |
hex | 7640e7663e30 |
130021132222000 has 160 divisors (see below), whose sum is σ = 328886477150400. Its totient is φ = 49650841856000.
The previous prime is 130021132221977. The next prime is 130021132222081. The reversal of 130021132222000 is 222231120031.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7432066 + ... + 17756065.
It is an arithmetic number, because the mean of its divisors is an integer number (2055540482190).
Almost surely, 2130021132222000 is an apocalyptic number.
130021132222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130021132222000 is an abundant number, since it is smaller than the sum of its proper divisors (198865344928400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130021132222000 is a wasteful number, since it uses less digits than its factorization.
130021132222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25188272 (or 25188256 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 130021132222000 its reverse (222231120031), we get a palindrome (130243363342031).
The spelling of 130021132222000 in words is "one hundred thirty trillion, twenty-one billion, one hundred thirty-two million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •