Base | Representation |
---|---|
bin | 11100100001100110… |
… | …111001010100001101 |
3 | 2221001120010212122100 |
4 | 130201212321110031 |
5 | 1000211411143222 |
6 | 22023125305313 |
7 | 2133001635630 |
oct | 344146712415 |
9 | 87046125570 |
10 | 30628615437 |
11 | 11a98067122 |
12 | 5b29565239 |
13 | 2b7169c6b4 |
14 | 16a7b1dc17 |
15 | be3dea4ac |
hex | 7219b950d |
30628615437 has 48 divisors (see below), whose sum is σ = 55381847040. Its totient is φ = 15904498176.
The previous prime is 30628615421. The next prime is 30628615477. The reversal of 30628615437 is 73451682603.
30628615437 is a `hidden beast` number, since 3 + 0 + 6 + 28 + 615 + 4 + 3 + 7 = 666.
It is not a de Polignac number, because 30628615437 - 24 = 30628615421 is a prime.
It is a super-2 number, since 2×306286154372 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30628615392 and 30628615401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30628615417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 462013 + ... + 524130.
It is an arithmetic number, because the mean of its divisors is an integer number (1153788480).
Almost surely, 230628615437 is an apocalyptic number.
It is an amenable number.
30628615437 is a deficient number, since it is larger than the sum of its proper divisors (24753231603).
30628615437 is a wasteful number, since it uses less digits than its factorization.
30628615437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 986202 (or 986199 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 30628615437 in words is "thirty billion, six hundred twenty-eight million, six hundred fifteen thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •