Base | Representation |
---|---|
bin | 11100011101111111… |
… | …101110110011101011 |
3 | 2220220100010011101122 |
4 | 130131333232303223 |
5 | 1000100403022011 |
6 | 22013122405455 |
7 | 2131334600321 |
oct | 343577566353 |
9 | 86810104348 |
10 | 30568017131 |
11 | 11a66937783 |
12 | 5b1120088b |
13 | 2b61c73302 |
14 | 169da67d11 |
15 | bdd92a3db |
hex | 71dfeeceb |
30568017131 has 2 divisors, whose sum is σ = 30568017132. Its totient is φ = 30568017130.
The previous prime is 30568017097. The next prime is 30568017143. The reversal of 30568017131 is 13171086503.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30568017131 is a prime.
It is a super-2 number, since 2×305680171312 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 30568017091 and 30568017100.
It is not a weakly prime, because it can be changed into another prime (30568017331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15284008565 + 15284008566.
It is an arithmetic number, because the mean of its divisors is an integer number (15284008566).
Almost surely, 230568017131 is an apocalyptic number.
30568017131 is a deficient number, since it is larger than the sum of its proper divisors (1).
30568017131 is an equidigital number, since it uses as much as digits as its factorization.
30568017131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 35.
The spelling of 30568017131 in words is "thirty billion, five hundred sixty-eight million, seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •