Base | Representation |
---|---|
bin | 11100010000101000… |
… | …000010100110010101 |
3 | 2220022201000211011101 |
4 | 130100220002212111 |
5 | 444120441443213 |
6 | 21534550510101 |
7 | 2122642135135 |
oct | 342050024625 |
9 | 86281024141 |
10 | 30343702933 |
11 | 11961258145 |
12 | 5a6a065331 |
13 | 2b2765500b |
14 | 167bd56ac5 |
15 | bc8dbbbdd |
hex | 710a02995 |
30343702933 has 8 divisors (see below), whose sum is σ = 30892665600. Its totient is φ = 29796402480.
The previous prime is 30343702927. The next prime is 30343703119. The reversal of 30343702933 is 33920734303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30343702933 - 213 = 30343694741 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30343702892 and 30343702901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30343802933) 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 7 ways as a sum of consecutive naturals, for example, 378685 + ... + 451762.
It is an arithmetic number, because the mean of its divisors is an integer number (3861583200).
Almost surely, 230343702933 is an apocalyptic number.
It is an amenable number.
30343702933 is a deficient number, since it is larger than the sum of its proper divisors (548962667).
30343702933 is an equidigital number, since it uses as much as digits as its factorization.
30343702933 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 831107.
The product of its (nonzero) digits is 122472, while the sum is 37.
It can be divided in two parts, 3034370 and 2933, that added together give a palindrome (3037303).
The spelling of 30343702933 in words is "thirty billion, three hundred forty-three million, seven hundred two thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •