Base | Representation |
---|---|
bin | 111100100101100101… |
… | …1000001110011001000 |
3 | 110102211121022001000112 |
4 | 1321023023001303020 |
5 | 4112431202413112 |
6 | 135434413053452 |
7 | 12254152314110 |
oct | 1711313016310 |
9 | 412747261015 |
10 | 130110201032 |
11 | 501a78a8869 |
12 | 21271787288 |
13 | c36697a546 |
14 | 6423d94040 |
15 | 35b7880a22 |
hex | 1e4b2c1cc8 |
130110201032 has 16 divisors (see below), whose sum is σ = 278807573760. Its totient is φ = 55761514704.
The previous prime is 130110200999. The next prime is 130110201037. The reversal of 130110201032 is 230102011031.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 130110200998 and 130110201016.
It is not an unprimeable number, because it can be changed into a prime (130110201037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1161698168 + ... + 1161698279.
It is an arithmetic number, because the mean of its divisors is an integer number (17425473360).
Almost surely, 2130110201032 is an apocalyptic number.
It is an amenable number.
130110201032 is an abundant number, since it is smaller than the sum of its proper divisors (148697372728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130110201032 is a wasteful number, since it uses less digits than its factorization.
130110201032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2323396460 (or 2323396456 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 130110201032 its reverse (230102011031), we get a palindrome (360212212063).
The spelling of 130110201032 in words is "one hundred thirty billion, one hundred ten million, two hundred one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •