Base | Representation |
---|---|
bin | 11100100010101100… |
… | …000111001110010101 |
3 | 2221002211021201202211 |
4 | 130202230013032111 |
5 | 1000231032312331 |
6 | 22025014233421 |
7 | 2133312110341 |
oct | 344254071625 |
9 | 87084251684 |
10 | 30646760341 |
11 | 11aa732a70a |
12 | 5b33655871 |
13 | 2b75383622 |
14 | 16aa2c4621 |
15 | be57d18b1 |
hex | 722b07395 |
30646760341 has 4 divisors (see below), whose sum is σ = 30712952512. Its totient is φ = 30580568172.
The previous prime is 30646760329. The next prime is 30646760369. The reversal of 30646760341 is 14306764603.
It is a happy number.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30646760341 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30646760294 and 30646760303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30646760381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33095391 + ... + 33096316.
It is an arithmetic number, because the mean of its divisors is an integer number (7678238128).
Almost surely, 230646760341 is an apocalyptic number.
It is an amenable number.
30646760341 is a deficient number, since it is larger than the sum of its proper divisors (66192171).
30646760341 is an equidigital number, since it uses as much as digits as its factorization.
30646760341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66192170.
The product of its (nonzero) digits is 217728, while the sum is 40.
The spelling of 30646760341 in words is "thirty billion, six hundred forty-six million, seven hundred sixty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •