Base | Representation |
---|---|
bin | 11100101100100110… |
… | …010100001010010110 |
3 | 2221112102010020001000 |
4 | 130230212110022112 |
5 | 1001101112401010 |
6 | 22053313444130 |
7 | 2140401200031 |
oct | 345446241226 |
9 | 87472106030 |
10 | 30813012630 |
11 | 120821624a4 |
12 | 5b7b270646 |
13 | 2ba0952b6a |
14 | 16c4400018 |
15 | c051c17c0 |
hex | 72c994296 |
30813012630 has 32 divisors (see below), whose sum is σ = 82168034400. Its totient is φ = 8216803296.
The previous prime is 30813012583. The next prime is 30813012631. The reversal of 30813012630 is 3621031803.
It is a happy number.
30813012630 is a `hidden beast` number, since 3 + 0 + 8 + 13 + 0 + 12 + 630 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 30813012594 and 30813012603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30813012631) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57060865 + ... + 57061404.
It is an arithmetic number, because the mean of its divisors is an integer number (2567751075).
Almost surely, 230813012630 is an apocalyptic number.
30813012630 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30813012630 is an abundant number, since it is smaller than the sum of its proper divisors (51355021770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30813012630 is a wasteful number, since it uses less digits than its factorization.
30813012630 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114122285 (or 114122279 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 30813012630 in words is "thirty billion, eight hundred thirteen million, twelve thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •