Base | Representation |
---|---|
bin | 111100100101101010… |
… | …1110000010101101100 |
3 | 110102211210120220110012 |
4 | 1321023111300111230 |
5 | 4112432412404400 |
6 | 135434553232352 |
7 | 12254215235420 |
oct | 1711325602554 |
9 | 412753526405 |
10 | 130113013100 |
11 | 501a9449594 |
12 | 212727026b8 |
13 | c3674234a5 |
14 | 64244c6b80 |
15 | 35b7c38d35 |
hex | 1e4b57056c |
130113013100 has 36 divisors (see below), whose sum is σ = 322680274224. Its totient is φ = 44610175680.
The previous prime is 130113013097. The next prime is 130113013123. The reversal of 130113013100 is 1310311031.
It is a happy number.
It is a super-3 number, since 3×1301130131003 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 92937167 + ... + 92938566.
Almost surely, 2130113013100 is an apocalyptic number.
130113013100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130113013100 is an abundant number, since it is smaller than the sum of its proper divisors (192567261124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130113013100 is a wasteful number, since it uses less digits than its factorization.
130113013100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185875754 (or 185875747 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 130113013100 its reverse (1310311031), we get a palindrome (131423324131).
The spelling of 130113013100 in words is "one hundred thirty billion, one hundred thirteen million, thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •