Base | Representation |
---|---|
bin | 1101111011010100100010… |
… | …01111101100011101011000 |
3 | 11000102202220111012202211111 |
4 | 12331222101033230131120 |
5 | 13003232113212143224 |
6 | 145045103552310104 |
7 | 6310423524462310 |
oct | 675522117543530 |
9 | 130382814182744 |
10 | 30625553631064 |
11 | 9838251688907 |
12 | 352752bb42334 |
13 | 1411c922150c2 |
14 | 77c3db330440 |
15 | 381993227d94 |
hex | 1bda913ec758 |
30625553631064 has 32 divisors (see below), whose sum is σ = 65630170260000. Its totient is φ = 13124440488960.
The previous prime is 30625553630999. The next prime is 30625553631083. The reversal of 30625553631064 is 46013635552603.
It is a junction number, because it is equal to n+sod(n) for n = 30625553630999 and 30625553631017.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15668439 + ... + 17514310.
It is an arithmetic number, because the mean of its divisors is an integer number (2050942820625).
Almost surely, 230625553631064 is an apocalyptic number.
It is an amenable number.
30625553631064 is an abundant number, since it is smaller than the sum of its proper divisors (35004616628936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30625553631064 is a wasteful number, since it uses less digits than its factorization.
30625553631064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33199243 (or 33199239 counting only the distinct ones).
The product of its (nonzero) digits is 5832000, while the sum is 49.
The spelling of 30625553631064 in words is "thirty trillion, six hundred twenty-five billion, five hundred fifty-three million, six hundred thirty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •