Base | Representation |
---|---|
bin | 1101101110111101110001… |
… | …00011001110101101100101 |
3 | 10221221012002101220212110022 |
4 | 12313132320203032231211 |
5 | 12424303132343114341 |
6 | 144122053021004525 |
7 | 6234644133303245 |
oct | 667367043165545 |
9 | 127835071825408 |
10 | 30201011301221 |
11 | 96941a45a4892 |
12 | 34791a96b3745 |
13 | 13b0c351244c7 |
14 | 765a458bbb25 |
15 | 3758e6e12e4b |
hex | 1b77b88ceb65 |
30201011301221 has 2 divisors, whose sum is σ = 30201011301222. Its totient is φ = 30201011301220.
The previous prime is 30201011301157. The next prime is 30201011301259. The reversal of 30201011301221 is 12210311010203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29667782750596 + 533228550625 = 5446814^2 + 730225^2 .
It is a cyclic number.
It is not a de Polignac number, because 30201011301221 - 26 = 30201011301157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30201011301221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30201011331221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100505650610 + 15100505650611.
It is an arithmetic number, because the mean of its divisors is an integer number (15100505650611).
Almost surely, 230201011301221 is an apocalyptic number.
It is an amenable number.
30201011301221 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201011301221 is an equidigital number, since it uses as much as digits as its factorization.
30201011301221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 30201011301221 its reverse (12210311010203), we get a palindrome (42411322311424).
The spelling of 30201011301221 in words is "thirty trillion, two hundred one billion, eleven million, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •