Base | Representation |
---|---|
bin | 1101110100110011000101… |
… | …00111001001000011110001 |
3 | 10222122100102010121110221021 |
4 | 12322121202213021003301 |
5 | 12441044113313331402 |
6 | 144354120412255441 |
7 | 6255300564223066 |
oct | 672314247110361 |
9 | 128570363543837 |
10 | 30401432948977 |
11 | 97611a2377202 |
12 | 34b0002471581 |
13 | 13c6ac58c439c |
14 | 77161999ac6d |
15 | 37ac273c4d37 |
hex | 1ba6629c90f1 |
30401432948977 has 2 divisors, whose sum is σ = 30401432948978. Its totient is φ = 30401432948976.
The previous prime is 30401432948959. The next prime is 30401432948993. The reversal of 30401432948977 is 77984923410403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24510113691361 + 5891319257616 = 4950769^2 + 2427204^2 .
It is an emirp because it is prime and its reverse (77984923410403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30401432948977 - 215 = 30401432916209 is a prime.
It is a super-2 number, since 2×304014329489772 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30401432948947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15200716474488 + 15200716474489.
It is an arithmetic number, because the mean of its divisors is an integer number (15200716474489).
Almost surely, 230401432948977 is an apocalyptic number.
It is an amenable number.
30401432948977 is a deficient number, since it is larger than the sum of its proper divisors (1).
30401432948977 is an equidigital number, since it uses as much as digits as its factorization.
30401432948977 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36578304, while the sum is 61.
The spelling of 30401432948977 in words is "thirty trillion, four hundred one billion, four hundred thirty-two million, nine hundred forty-eight thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •