Base | Representation |
---|---|
bin | 11100010111000001… |
… | …110101111100001101 |
3 | 2220121012011200120021 |
4 | 130113001311330031 |
5 | 444330442131000 |
6 | 21553345222141 |
7 | 2125415223013 |
oct | 342701657415 |
9 | 86535150507 |
10 | 30451130125 |
11 | 11a06961849 |
12 | 5a9a031951 |
13 | 2b439992c0 |
14 | 168c31c8b3 |
15 | bd353c11a |
hex | 717075f0d |
30451130125 has 64 divisors (see below), whose sum is σ = 42032390400. Its totient is φ = 21886176000.
The previous prime is 30451130123. The next prime is 30451130141. The reversal of 30451130125 is 52103115403.
It is a happy number.
It is not a de Polignac number, because 30451130125 - 21 = 30451130123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 30451130125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30451130123) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 11281026 + ... + 11283724.
It is an arithmetic number, because the mean of its divisors is an integer number (656756100).
Almost surely, 230451130125 is an apocalyptic number.
It is an amenable number.
30451130125 is a deficient number, since it is larger than the sum of its proper divisors (11581260275).
30451130125 is a wasteful number, since it uses less digits than its factorization.
30451130125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2911 (or 2901 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 30451130125 its reverse (52103115403), we get a palindrome (82554245528).
The spelling of 30451130125 in words is "thirty billion, four hundred fifty-one million, one hundred thirty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •