Base | Representation |
---|---|
bin | 111100101000010010… |
… | …1110100011001110100 |
3 | 110110001221100200212020 |
4 | 1321100211310121310 |
5 | 4113122441011012 |
6 | 135451421353140 |
7 | 12256335114162 |
oct | 1712045643164 |
9 | 413057320766 |
10 | 130201110132 |
11 | 50244150155 |
12 | 212981087b0 |
13 | c37c75a202 |
14 | 643209a232 |
15 | 35c083ba8c |
hex | 1e50974674 |
130201110132 has 12 divisors (see below), whose sum is σ = 303802590336. Its totient is φ = 43400370040.
The previous prime is 130201110119. The next prime is 130201110139. The reversal of 130201110132 is 231011102031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130201110139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5425046244 + ... + 5425046267.
It is an arithmetic number, because the mean of its divisors is an integer number (25316882528).
Almost surely, 2130201110132 is an apocalyptic number.
130201110132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130201110132 is an abundant number, since it is smaller than the sum of its proper divisors (173601480204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130201110132 is a wasteful number, since it uses less digits than its factorization.
130201110132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10850092518 (or 10850092516 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 130201110132 its reverse (231011102031), we get a palindrome (361212212163).
The spelling of 130201110132 in words is "one hundred thirty billion, two hundred one million, one hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •