Base | Representation |
---|---|
bin | 11100110011010100… |
… | …000110000001101100 |
3 | 2221211021010011000120 |
4 | 130303110012001230 |
5 | 1001313433123102 |
6 | 22112420324540 |
7 | 2143236625413 |
oct | 346324060154 |
9 | 87737104016 |
10 | 30925676652 |
11 | 1212a813662 |
12 | 5bb0b43750 |
13 | 2bbb0ab970 |
14 | 16d536a47a |
15 | c100286bc |
hex | 73350606c |
30925676652 has 48 divisors (see below), whose sum is σ = 78140086752. Its totient is φ = 9463011840.
The previous prime is 30925676603. The next prime is 30925676671. The reversal of 30925676652 is 25667652903.
It is a junction number, because it is equal to n+sod(n) for n = 30925676595 and 30925676604.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 519393 + ... + 575864.
It is an arithmetic number, because the mean of its divisors is an integer number (1627918474).
Almost surely, 230925676652 is an apocalyptic number.
It is an amenable number.
30925676652 is an abundant number, since it is smaller than the sum of its proper divisors (47214410100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30925676652 is a wasteful number, since it uses less digits than its factorization.
30925676652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095458 (or 1095456 counting only the distinct ones).
The product of its (nonzero) digits is 4082400, while the sum is 51.
The spelling of 30925676652 in words is "thirty billion, nine hundred twenty-five million, six hundred seventy-six thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •