Base | Representation |
---|---|
bin | 111010011100… |
… | …1001011100001 |
3 | 2010122211011201 |
4 | 1310321023201 |
5 | 30321033123 |
6 | 3012441201 |
7 | 521313640 |
oct | 164711341 |
9 | 63584151 |
10 | 30642913 |
11 | 1632a524 |
12 | a319201 |
13 | 646b802 |
14 | 40d9357 |
15 | 2a545ad |
hex | 1d392e1 |
30642913 has 4 divisors (see below), whose sum is σ = 35020480. Its totient is φ = 26265348.
The previous prime is 30642869. The next prime is 30642929. The reversal of 30642913 is 31924603.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31924603 = 53 ⋅602351.
It is a cyclic number.
It is not a de Polignac number, because 30642913 - 217 = 30511841 is a prime.
It is a super-3 number, since 3×306429133 (a number of 23 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30642113) 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 3 ways as a sum of consecutive naturals, for example, 2188773 + ... + 2188786.
It is an arithmetic number, because the mean of its divisors is an integer number (8755120).
Almost surely, 230642913 is an apocalyptic number.
It is an amenable number.
30642913 is a deficient number, since it is larger than the sum of its proper divisors (4377567).
30642913 is an equidigital number, since it uses as much as digits as its factorization.
30642913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4377566.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 30642913 is about 5535.6041224062. The cubic root of 30642913 is about 312.9272253716.
The spelling of 30642913 in words is "thirty million, six hundred forty-two thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •