Base | Representation |
---|---|
bin | 11100010101111010… |
… | …000000110100010111 |
3 | 2220112212202000220202 |
4 | 130111322000310113 |
5 | 444311132102221 |
6 | 21551433451115 |
7 | 2125066166420 |
oct | 342572006427 |
9 | 86485660822 |
10 | 30432300311 |
11 | 119a7270716 |
12 | 5a93870a9b |
13 | 2b3cb056ba |
14 | 1689a1a647 |
15 | bd1a6cd0b |
hex | 715e80d17 |
30432300311 has 8 divisors (see below), whose sum is σ = 35719765920. Its totient is φ = 25379833248.
The previous prime is 30432300277. The next prime is 30432300331. The reversal of 30432300311 is 11300323403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30432300311 - 226 = 30365191447 is a prime.
It is a super-3 number, since 3×304323003113 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30432300331) 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 7 ways as a sum of consecutive naturals, for example, 58749356 + ... + 58749873.
It is an arithmetic number, because the mean of its divisors is an integer number (4464970740).
Almost surely, 230432300311 is an apocalyptic number.
30432300311 is a deficient number, since it is larger than the sum of its proper divisors (5287465609).
30432300311 is a wasteful number, since it uses less digits than its factorization.
30432300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117499273.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30432300311 its reverse (11300323403), we get a palindrome (41732623714).
The spelling of 30432300311 in words is "thirty billion, four hundred thirty-two million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •