Base | Representation |
---|---|
bin | 111100101110010011… |
… | …0010000100100111000 |
3 | 110110120222102000022121 |
4 | 1321130212100210320 |
5 | 4114031023131440 |
6 | 135523415131024 |
7 | 12264332255461 |
oct | 1713446204470 |
9 | 413528360277 |
10 | 130402552120 |
11 | 50337928535 |
12 | 21333673a74 |
13 | c3b23ca959 |
14 | 6450b35d68 |
15 | 35d337d34a |
hex | 1e5c990938 |
130402552120 has 32 divisors (see below), whose sum is σ = 310664905200. Its totient is φ = 49092725248.
The previous prime is 130402552097. The next prime is 130402552127. The reversal of 130402552120 is 21255204031.
130402552120 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130402552127) 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 7 ways as a sum of consecutive naturals, for example, 95883550 + ... + 95884909.
Almost surely, 2130402552120 is an apocalyptic number.
130402552120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130402552120 is an abundant number, since it is smaller than the sum of its proper divisors (180262353080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130402552120 is a wasteful number, since it uses less digits than its factorization.
130402552120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191768487 (or 191768483 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 130402552120 its reverse (21255204031), we get a palindrome (151657756151).
The spelling of 130402552120 in words is "one hundred thirty billion, four hundred two million, five hundred fifty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •