Base | Representation |
---|---|
bin | 11100100111001111… |
… | …000111111010010001 |
3 | 2221022010211111110202 |
4 | 130213033013322101 |
5 | 1000410100001212 |
6 | 22040341304545 |
7 | 2135226406523 |
oct | 344717077221 |
9 | 87263744422 |
10 | 30723047057 |
11 | 120363a4a8a |
12 | 5b55105155 |
13 | 2b881137b1 |
14 | 16b64a1a13 |
15 | bec3500c2 |
hex | 7273c7e91 |
30723047057 has 2 divisors, whose sum is σ = 30723047058. Its totient is φ = 30723047056.
The previous prime is 30723047009. The next prime is 30723047059. The reversal of 30723047057 is 75074032703.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29159319121 + 1563727936 = 170761^2 + 39544^2 .
It is an emirp because it is prime and its reverse (75074032703) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30723047057 - 26 = 30723046993 is a prime.
It is a super-2 number, since 2×307230470572 (a number of 22 digits) contains 22 as substring.
Together with 30723047059, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30723047057.
It is not a weakly prime, because it can be changed into another prime (30723047059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15361523528 + 15361523529.
It is an arithmetic number, because the mean of its divisors is an integer number (15361523529).
Almost surely, 230723047057 is an apocalyptic number.
It is an amenable number.
30723047057 is a deficient number, since it is larger than the sum of its proper divisors (1).
30723047057 is an equidigital number, since it uses as much as digits as its factorization.
30723047057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 123480, while the sum is 38.
The spelling of 30723047057 in words is "thirty billion, seven hundred twenty-three million, forty-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •