Base | Representation |
---|---|
bin | 1101101111000001011111… |
… | …10000101010100101111101 |
3 | 10221221101020210021221110111 |
4 | 12313200233300222211331 |
5 | 12424321231343440442 |
6 | 144123023304110021 |
7 | 6235044530151406 |
oct | 667405760524575 |
9 | 127841223257414 |
10 | 30203011311997 |
11 | 9695030549557 |
12 | 3479667465311 |
13 | 13b11935a3734 |
14 | 765b9537a9ad |
15 | 3759b27c8b17 |
hex | 1b782fc2a97d |
30203011311997 has 2 divisors, whose sum is σ = 30203011311998. Its totient is φ = 30203011311996.
The previous prime is 30203011311989. The next prime is 30203011312003. The reversal of 30203011311997 is 79911311030203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18828708710436 + 11374302601561 = 4339206^2 + 3372581^2 .
It is an emirp because it is prime and its reverse (79911311030203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30203011311997 - 23 = 30203011311989 is a prime.
It is a super-2 number, since 2×302030113119972 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30203011311197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15101505655998 + 15101505655999.
It is an arithmetic number, because the mean of its divisors is an integer number (15101505655999).
Almost surely, 230203011311997 is an apocalyptic number.
It is an amenable number.
30203011311997 is a deficient number, since it is larger than the sum of its proper divisors (1).
30203011311997 is an equidigital number, since it uses as much as digits as its factorization.
30203011311997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30618, while the sum is 40.
The spelling of 30203011311997 in words is "thirty trillion, two hundred three billion, eleven million, three hundred eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •