Base | Representation |
---|---|
bin | 1101101110111110000111… |
… | …11110100010110111110101 |
3 | 10221221012120202122201220202 |
4 | 12313133003332202313311 |
5 | 12424304030432323221 |
6 | 144122124030010245 |
7 | 6234651651642125 |
oct | 667370376426765 |
9 | 127835522581822 |
10 | 30201203011061 |
11 | 9694292835275 |
12 | 3479241946985 |
13 | 13b0c65a68294 |
14 | 765a63142c85 |
15 | 375908b80d0b |
hex | 1b77c3fa2df5 |
30201203011061 has 2 divisors, whose sum is σ = 30201203011062. Its totient is φ = 30201203011060.
The previous prime is 30201203011037. The next prime is 30201203011117. The reversal of 30201203011061 is 16011030210203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24315697899025 + 5885505112036 = 4931095^2 + 2426006^2 .
It is a cyclic number.
It is not a de Polignac number, because 30201203011061 - 218 = 30201202748917 is a prime.
It is a super-2 number, since 2×302012030110612 (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 (30201203011361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100601505530 + 15100601505531.
It is an arithmetic number, because the mean of its divisors is an integer number (15100601505531).
Almost surely, 230201203011061 is an apocalyptic number.
It is an amenable number.
30201203011061 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201203011061 is an equidigital number, since it uses as much as digits as its factorization.
30201203011061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 30201203011061 its reverse (16011030210203), we get a palindrome (46212233221264).
The spelling of 30201203011061 in words is "thirty trillion, two hundred one billion, two hundred three million, eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •