Base | Representation |
---|---|
bin | 1101101110111101110010… |
… | …01100111000111011101101 |
3 | 10221221012010011110201000212 |
4 | 12313132321030320323231 |
5 | 12424303143142101221 |
6 | 144122054051032205 |
7 | 6234644325156365 |
oct | 667367114707355 |
9 | 127835104421025 |
10 | 30201022222061 |
11 | 96941aa783879 |
12 | 34791b129b665 |
13 | 13b0c37479242 |
14 | 765a471219a5 |
15 | 3758e7d6db5b |
hex | 1b77b9338eed |
30201022222061 has 2 divisors, whose sum is σ = 30201022222062. Its totient is φ = 30201022222060.
The previous prime is 30201022222051. The next prime is 30201022222081. The reversal of 30201022222061 is 16022222010203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21351700224100 + 8849321997961 = 4620790^2 + 2974781^2 .
It is a cyclic number.
It is not a de Polignac number, because 30201022222061 - 218 = 30201021959917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30201022222051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100511111030 + 15100511111031.
It is an arithmetic number, because the mean of its divisors is an integer number (15100511111031).
Almost surely, 230201022222061 is an apocalyptic number.
It is an amenable number.
30201022222061 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201022222061 is an equidigital number, since it uses as much as digits as its factorization.
30201022222061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 30201022222061 its reverse (16022222010203), we get a palindrome (46223244232264).
The spelling of 30201022222061 in words is "thirty trillion, two hundred one billion, twenty-two million, two hundred twenty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •