Base | Representation |
---|---|
bin | 111100100110001111… |
… | …1010101000101001110 |
3 | 110102220010212210020220 |
4 | 1321030133111011032 |
5 | 4113002332100420 |
6 | 135440522452210 |
7 | 12254541204651 |
oct | 1711437250516 |
9 | 412803783226 |
10 | 130132300110 |
11 | 5020932216a |
12 | 21279064066 |
13 | c36b417217 |
14 | 6426ca7898 |
15 | 35b9798840 |
hex | 1e4c7d514e |
130132300110 has 64 divisors (see below), whose sum is σ = 315945100800. Its totient is φ = 34301209472.
The previous prime is 130132300073. The next prime is 130132300157. The reversal of 130132300110 is 11003231031.
It is a super-3 number, since 3×1301323001103 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 130132300110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 824236 + ... + 969344.
It is an arithmetic number, because the mean of its divisors is an integer number (4936642200).
Almost surely, 2130132300110 is an apocalyptic number.
130132300110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130132300110 is an abundant number, since it is smaller than the sum of its proper divisors (185812800690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130132300110 is a wasteful number, since it uses less digits than its factorization.
130132300110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145465.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 130132300110 its reverse (11003231031), we get a palindrome (141135531141).
The spelling of 130132300110 in words is "one hundred thirty billion, one hundred thirty-two million, three hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •