Base | Representation |
---|---|
bin | 111100100110001111… |
… | …0100111011011101100 |
3 | 110102220010112021202210 |
4 | 1321030132213123230 |
5 | 4113002310110012 |
6 | 135440514450420 |
7 | 12254536465560 |
oct | 1711436473354 |
9 | 412803467683 |
10 | 130132113132 |
11 | 5020920473a |
12 | 21278b93a10 |
13 | c36b380098 |
14 | 6426c596a0 |
15 | 35b975d23c |
hex | 1e4c7a76ec |
130132113132 has 24 divisors (see below), whose sum is σ = 347018968576. Its totient is φ = 37180603728.
The previous prime is 130132113127. The next prime is 130132113157. The reversal of 130132113132 is 231311231031.
It is a happy number.
130132113132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 130132113099 and 130132113108.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 774595828 + ... + 774595995.
Almost surely, 2130132113132 is an apocalyptic number.
130132113132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130132113132 is an abundant number, since it is smaller than the sum of its proper divisors (216886855444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130132113132 is a wasteful number, since it uses less digits than its factorization.
130132113132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1549191837 (or 1549191835 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 130132113132 its reverse (231311231031), we get a palindrome (361443344163).
The spelling of 130132113132 in words is "one hundred thirty billion, one hundred thirty-two million, one hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •