Base | Representation |
---|---|
bin | 1101110101000101100111… |
… | …01101111110101111011001 |
3 | 10222200022002121120111020211 |
4 | 12322202303231332233121 |
5 | 12441230003202141214 |
6 | 144402444034051121 |
7 | 6256102302510226 |
oct | 672426355765731 |
9 | 128608077514224 |
10 | 30411383630809 |
11 | 97654392667a5 |
12 | 34b1b1aa19aa1 |
13 | 13c7a203048bc |
14 | 771cc136294d |
15 | 37b10ac900c4 |
hex | 1ba8b3b7ebd9 |
30411383630809 has 2 divisors, whose sum is σ = 30411383630810. Its totient is φ = 30411383630808.
The previous prime is 30411383630767. The next prime is 30411383630867. The reversal of 30411383630809 is 90803638311403.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26801277230025 + 3610106400784 = 5176995^2 + 1900028^2 .
It is a cyclic number.
It is not a de Polignac number, because 30411383630809 - 29 = 30411383630297 is a prime.
It is a super-2 number, since 2×304113836308092 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30411383630209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15205691815404 + 15205691815405.
It is an arithmetic number, because the mean of its divisors is an integer number (15205691815405).
Almost surely, 230411383630809 is an apocalyptic number.
It is an amenable number.
30411383630809 is a deficient number, since it is larger than the sum of its proper divisors (1).
30411383630809 is an equidigital number, since it uses as much as digits as its factorization.
30411383630809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1119744, while the sum is 49.
The spelling of 30411383630809 in words is "thirty trillion, four hundred eleven billion, three hundred eighty-three million, six hundred thirty thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •