Base | Representation |
---|---|
bin | 111011000000… |
… | …0011010011001 |
3 | 2011012122101221 |
4 | 1312000122121 |
5 | 30404402211 |
6 | 3023012041 |
7 | 523640401 |
oct | 166003231 |
9 | 64178357 |
10 | 30934681 |
11 | 16509758 |
12 | a43a021 |
13 | 654155b |
14 | 4173801 |
15 | 2ab0c71 |
hex | 1d80699 |
30934681 has 4 divisors (see below), whose sum is σ = 31307472. Its totient is φ = 30561892.
The previous prime is 30934661. The next prime is 30934691. The reversal of 30934681 is 18643903.
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: 18643903 = 677 ⋅27539.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30934681 is a prime.
It is a super-2 number, since 2×309346812 = 1913908977143522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30934661) 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, 186271 + ... + 186436.
It is an arithmetic number, because the mean of its divisors is an integer number (7826868).
Almost surely, 230934681 is an apocalyptic number.
It is an amenable number.
30934681 is a deficient number, since it is larger than the sum of its proper divisors (372791).
30934681 is an equidigital number, since it uses as much as digits as its factorization.
30934681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372790.
The product of its (nonzero) digits is 15552, while the sum is 34.
The square root of 30934681 is about 5561.8954502939. The cubic root of 30934681 is about 313.9172737023.
The spelling of 30934681 in words is "thirty million, nine hundred thirty-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •