Base | Representation |
---|---|
bin | 111010000100… |
… | …1100000001111 |
3 | 2010021220022001 |
4 | 1310021200033 |
5 | 30243311011 |
6 | 3004333131 |
7 | 516541414 |
oct | 164114017 |
9 | 63256261 |
10 | 30447631 |
11 | 16206835 |
12 | a2441a7 |
13 | 6400966 |
14 | 408810b |
15 | 2a167c1 |
hex | 1d0980f |
30447631 has 4 divisors (see below), whose sum is σ = 30462952. Its totient is φ = 30432312.
The previous prime is 30447623. The next prime is 30447649. The reversal of 30447631 is 13674403.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13674403 = 139 ⋅98377.
It is a cyclic number.
It is not a de Polignac number, because 30447631 - 23 = 30447623 is a prime.
It is a super-2 number, since 2×304476312 = 1854116467024322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30447631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30447691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4140 + ... + 8833.
It is an arithmetic number, because the mean of its divisors is an integer number (7615738).
Almost surely, 230447631 is an apocalyptic number.
30447631 is a deficient number, since it is larger than the sum of its proper divisors (15321).
30447631 is a wasteful number, since it uses less digits than its factorization.
30447631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15320.
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 30447631 is about 5517.9372051519. The cubic root of 30447631 is about 312.2610645047.
The spelling of 30447631 in words is "thirty million, four hundred forty-seven thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •