Base | Representation |
---|---|
bin | 1101111000000101100000… |
… | …01011000100110100000101 |
3 | 11000001011000020101011211022 |
4 | 12330002300023010310011 |
5 | 12444421444230122401 |
6 | 144522042352320525 |
7 | 6266410235006666 |
oct | 674026013046405 |
9 | 130034006334738 |
10 | 30514403364101 |
11 | 97a50a4210148 |
12 | 3509a8bb43145 |
13 | 140465a617777 |
14 | 776c9548536d |
15 | 37db3a16a71b |
hex | 1bc0b02c4d05 |
30514403364101 has 2 divisors, whose sum is σ = 30514403364102. Its totient is φ = 30514403364100.
The previous prime is 30514403364097. The next prime is 30514403364113. The reversal of 30514403364101 is 10146330441503.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29788388599876 + 726014764225 = 5457874^2 + 852065^2 .
It is a cyclic number.
It is not a de Polignac number, because 30514403364101 - 22 = 30514403364097 is a prime.
It is a super-2 number, since 2×305144033641012 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30514403364191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15257201682050 + 15257201682051.
It is an arithmetic number, because the mean of its divisors is an integer number (15257201682051).
Almost surely, 230514403364101 is an apocalyptic number.
It is an amenable number.
30514403364101 is a deficient number, since it is larger than the sum of its proper divisors (1).
30514403364101 is an equidigital number, since it uses as much as digits as its factorization.
30514403364101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 30514403364101 in words is "thirty trillion, five hundred fourteen billion, four hundred three million, three hundred sixty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •