Base | Representation |
---|---|
bin | 111100101001111000… |
… | …1100100101010101010 |
3 | 110110012122212100121110 |
4 | 1321103301210222222 |
5 | 4113230124214200 |
6 | 135501010251150 |
7 | 12260554115031 |
oct | 1712361445252 |
9 | 413178770543 |
10 | 130254523050 |
11 | 50271312063 |
12 | 212b1b86ab6 |
13 | c38a83bba2 |
14 | 6439201718 |
15 | 35c538cb50 |
hex | 1e53c64aaa |
130254523050 has 48 divisors (see below), whose sum is σ = 328326833952. Its totient is φ = 34165118400.
The previous prime is 130254523001. The next prime is 130254523097. The reversal of 130254523050 is 50325452031.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 130254522999 and 130254523017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7108584 + ... + 7126883.
It is an arithmetic number, because the mean of its divisors is an integer number (6840142374).
Almost surely, 2130254523050 is an apocalyptic number.
130254523050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130254523050 is an abundant number, since it is smaller than the sum of its proper divisors (198072310902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130254523050 is a wasteful number, since it uses less digits than its factorization.
130254523050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14235543 (or 14235538 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 130254523050 its reverse (50325452031), we get a palindrome (180579975081).
The spelling of 130254523050 in words is "one hundred thirty billion, two hundred fifty-four million, five hundred twenty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •