Base | Representation |
---|---|
bin | 11100000100000000… |
… | …011111110101001111 |
3 | 2212202221200201111012 |
4 | 130010000133311033 |
5 | 443202243312234 |
6 | 21501545315435 |
7 | 2114461601405 |
oct | 340400376517 |
9 | 85687621435 |
10 | 30132010319 |
11 | 11862809374 |
12 | 5a0b195b7b |
13 | 2ac2835908 |
14 | 165bbad475 |
15 | bb55030ce |
hex | 70401fd4f |
30132010319 has 2 divisors, whose sum is σ = 30132010320. Its totient is φ = 30132010318.
The previous prime is 30132010277. The next prime is 30132010333. The reversal of 30132010319 is 91301023103.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30132010319 - 216 = 30131944783 is a prime.
It is a super-2 number, since 2×301320103192 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30132010294 and 30132010303.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30132010399) 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 as a sum of consecutive naturals, namely, 15066005159 + 15066005160.
It is an arithmetic number, because the mean of its divisors is an integer number (15066005160).
Almost surely, 230132010319 is an apocalyptic number.
30132010319 is a deficient number, since it is larger than the sum of its proper divisors (1).
30132010319 is an equidigital number, since it uses as much as digits as its factorization.
30132010319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
The spelling of 30132010319 in words is "thirty billion, one hundred thirty-two million, ten thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •