Base | Representation |
---|---|
bin | 111001101000… |
… | …1111100110000 |
3 | 2002212100011020 |
4 | 1303101330300 |
5 | 30214020310 |
6 | 2555415440 |
7 | 514603122 |
oct | 163217460 |
9 | 62770136 |
10 | 30220080 |
11 | 16070880 |
12 | a154580 |
13 | 6351207 |
14 | 4029212 |
15 | 29be170 |
hex | 1cd1f30 |
30220080 has 80 divisors (see below), whose sum is σ = 102207744. Its totient is φ = 7325440.
The previous prime is 30220079. The next prime is 30220081. The reversal of 30220080 is 8002203.
It is an interprime number because it is at equal distance from previous prime (30220079) and next prime (30220081).
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (30220081) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3084 + ... + 8363.
Almost surely, 230220080 is an apocalyptic number.
30220080 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30220080 is an abundant number, since it is smaller than the sum of its proper divisors (71987664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30220080 is a wasteful number, since it uses less digits than its factorization.
30220080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11474 (or 11468 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 30220080 is about 5497.2793270854. The cubic root of 30220080 is about 311.4812220353.
Adding to 30220080 its reverse (8002203), we get a palindrome (38222283).
The spelling of 30220080 in words is "thirty million, two hundred twenty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •