Base | Representation |
---|---|
bin | 111010011001… |
… | …0011001110100 |
3 | 2010121102002200 |
4 | 1310302121310 |
5 | 30314141111 |
6 | 3012104500 |
7 | 521140005 |
oct | 164623164 |
9 | 63542080 |
10 | 30615156 |
11 | 16310690 |
12 | a305130 |
13 | 645bca0 |
14 | 40cd1ac |
15 | 2a4b256 |
hex | 1d32674 |
30615156 has 144 divisors (see below), whose sum is σ = 96008640. Its totient is φ = 8087040.
The previous prime is 30615127. The next prime is 30615187. The reversal of 30615156 is 65151603.
It is a happy number.
30615156 is a `hidden beast` number, since 30 + 615 + 15 + 6 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 97656 + ... + 97968.
Almost surely, 230615156 is an apocalyptic number.
30615156 is a gapful number since it is divisible by the number (36) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30615156, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48004320).
30615156 is an abundant number, since it is smaller than the sum of its proper divisors (65393484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30615156 is a wasteful number, since it uses less digits than its factorization.
30615156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366 (or 361 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 30615156 is about 5533.0964206310. The cubic root of 30615156 is about 312.8327114575.
Adding to 30615156 its reverse (65151603), we get a palindrome (95766759).
The spelling of 30615156 in words is "thirty million, six hundred fifteen thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •