Base | Representation |
---|---|
bin | 11100010101111010… |
… | …000011010010000101 |
3 | 2220112212202112202121 |
4 | 130111322003102011 |
5 | 444311132413110 |
6 | 21551434005541 |
7 | 2125066241020 |
oct | 342572032205 |
9 | 86485675677 |
10 | 30432310405 |
11 | 119a7278262 |
12 | 5a938768b1 |
13 | 2b3cb0a183 |
14 | 1689a201b7 |
15 | bd1a70cda |
hex | 715e83485 |
30432310405 has 8 divisors (see below), whose sum is σ = 41735740032. Its totient is φ = 20867869968.
The previous prime is 30432310399. The next prime is 30432310421. The reversal of 30432310405 is 50401323403.
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 30432310405 - 25 = 30432310373 is a prime.
It is a super-2 number, since 2×304323104052 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30432310405.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 434747257 + ... + 434747326.
It is an arithmetic number, because the mean of its divisors is an integer number (5216967504).
Almost surely, 230432310405 is an apocalyptic number.
30432310405 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30432310405 is a deficient number, since it is larger than the sum of its proper divisors (11303429627).
30432310405 is an equidigital number, since it uses as much as digits as its factorization.
30432310405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 869494595.
The product of its (nonzero) digits is 4320, while the sum is 25.
Adding to 30432310405 its reverse (50401323403), we get a palindrome (80833633808).
The spelling of 30432310405 in words is "thirty billion, four hundred thirty-two million, three hundred ten thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •