Base | Representation |
---|---|
bin | 111010011001… |
… | …1111101110100 |
3 | 2010121201212201 |
4 | 1310303331310 |
5 | 30314342211 |
6 | 3012154244 |
7 | 521164450 |
oct | 164637564 |
9 | 63551781 |
10 | 30621556 |
11 | 16315479 |
12 | a308984 |
13 | 6461b84 |
14 | 40d1660 |
15 | 2a4d0c1 |
hex | 1d33f74 |
30621556 has 48 divisors (see below), whose sum is σ = 67689216. Its totient is φ = 11810304.
The previous prime is 30621553. The next prime is 30621571. The reversal of 30621556 is 65512603.
It is a super-2 number, since 2×306215562 = 1875359383722272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30621553) 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, 9550 + ... + 12346.
It is an arithmetic number, because the mean of its divisors is an integer number (1410192).
Almost surely, 230621556 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30621556, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33844608).
30621556 is an abundant number, since it is smaller than the sum of its proper divisors (37067660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30621556 is a wasteful number, since it uses less digits than its factorization.
30621556 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2848 (or 2846 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 30621556 is about 5533.6747284241. The cubic root of 30621556 is about 312.8545088298.
The spelling of 30621556 in words is "thirty million, six hundred twenty-one thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •