Base | Representation |
---|---|
bin | 1101110010000001011000… |
… | …11101101000011111110101 |
3 | 10222022020011200221000122022 |
4 | 12321000230131220133311 |
5 | 12433013230003044013 |
6 | 144242222251442525 |
7 | 6245352542620661 |
oct | 671005435503765 |
9 | 128266150830568 |
10 | 30306035206133 |
11 | 9724798885015 |
12 | 3495619a56445 |
13 | 13bab0171243b |
14 | 76ab69c638a1 |
15 | 3784e2227008 |
hex | 1b902c7687f5 |
30306035206133 has 2 divisors, whose sum is σ = 30306035206134. Its totient is φ = 30306035206132.
The previous prime is 30306035206121. The next prime is 30306035206193. The reversal of 30306035206133 is 33160253060303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28915161707524 + 1390873498609 = 5377282^2 + 1179353^2 .
It is a cyclic number.
It is not a de Polignac number, because 30306035206133 - 226 = 30305968097269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30306035206093 and 30306035206102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30306035206193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15153017603066 + 15153017603067.
It is an arithmetic number, because the mean of its divisors is an integer number (15153017603067).
Almost surely, 230306035206133 is an apocalyptic number.
It is an amenable number.
30306035206133 is a deficient number, since it is larger than the sum of its proper divisors (1).
30306035206133 is an equidigital number, since it uses as much as digits as its factorization.
30306035206133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 87480, while the sum is 35.
Adding to 30306035206133 its reverse (33160253060303), we get a palindrome (63466288266436).
The spelling of 30306035206133 in words is "thirty trillion, three hundred six billion, thirty-five million, two hundred six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •