Base | Representation |
---|---|
bin | 111100101110010010… |
… | …1101001001010110110 |
3 | 110110120222002210220110 |
4 | 1321130211221022312 |
5 | 4114031003000320 |
6 | 135523411443450 |
7 | 12264331014054 |
oct | 1713445511266 |
9 | 413528083813 |
10 | 130402390710 |
11 | 50337828239 |
12 | 213335b6586 |
13 | c3b2372347 |
14 | 6450ad31d4 |
15 | 35d334a5e0 |
hex | 1e5c9692b6 |
130402390710 has 32 divisors (see below), whose sum is σ = 318096328032. Its totient is φ = 34203905280.
The previous prime is 130402390693. The next prime is 130402390711. The reversal of 130402390710 is 17093204031.
130402390710 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 (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130402390711) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35627239 + ... + 35630898.
It is an arithmetic number, because the mean of its divisors is an integer number (9940510251).
Almost surely, 2130402390710 is an apocalyptic number.
130402390710 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130402390710 is an abundant number, since it is smaller than the sum of its proper divisors (187693937322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130402390710 is a wasteful number, since it uses less digits than its factorization.
130402390710 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71258208.
The product of its (nonzero) digits is 4536, while the sum is 30.
Adding to 130402390710 its reverse (17093204031), we get a palindrome (147495594741).
The spelling of 130402390710 in words is "one hundred thirty billion, four hundred two million, three hundred ninety thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •