Base | Representation |
---|---|
bin | 11101100101011000011011… |
… | …101001110100100100101100 |
3 | 122001200121100011011002100002 |
4 | 131211120123221310210230 |
5 | 114023224243010304400 |
6 | 1140420415422123432 |
7 | 36256203455242643 |
oct | 3545303351644454 |
9 | 561617304132302 |
10 | 130112203213100 |
11 | 38504303771a09 |
12 | 12714749720578 |
13 | 577a6b336a084 |
14 | 241b66dc1835a |
15 | 10097b4ce4ed5 |
hex | 76561ba7492c |
130112203213100 has 72 divisors (see below), whose sum is σ = 285461475129600. Its totient is φ = 51473267968320.
The previous prime is 130112203213081. The next prime is 130112203213123. The reversal of 130112203213100 is 1312302211031.
It is a happy number.
It is a super-2 number, since 2×1301122032131002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16252454 + ... + 22899053.
Almost surely, 2130112203213100 is an apocalyptic number.
130112203213100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130112203213100 is an abundant number, since it is smaller than the sum of its proper divisors (155349271916500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130112203213100 is a wasteful number, since it uses less digits than its factorization.
130112203213100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39151887 (or 39151880 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 130112203213100 its reverse (1312302211031), we get a palindrome (131424505424131).
The spelling of 130112203213100 in words is "one hundred thirty trillion, one hundred twelve billion, two hundred three million, two hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •