Base | Representation |
---|---|
bin | 1101110100110011000101… |
… | …01000001000110100001001 |
3 | 10222122100102011002202011021 |
4 | 12322121202220020310021 |
5 | 12441044113400210441 |
6 | 144354120422032441 |
7 | 6255300566361331 |
oct | 672314250106411 |
9 | 128570364082137 |
10 | 30401433210121 |
11 | 97611a2535426 |
12 | 34b0002578721 |
13 | 13c6ac59861cc |
14 | 771619a280c1 |
15 | 37ac274273d1 |
hex | 1ba662a08d09 |
30401433210121 has 2 divisors, whose sum is σ = 30401433210122. Its totient is φ = 30401433210120.
The previous prime is 30401433210061. The next prime is 30401433210143. The reversal of 30401433210121 is 12101233410403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27444973052025 + 2956460158096 = 5238795^2 + 1719436^2 .
It is a cyclic number.
It is not a de Polignac number, because 30401433210121 - 223 = 30401424821513 is a prime.
It is not a weakly prime, because it can be changed into another prime (30401433210521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15200716605060 + 15200716605061.
It is an arithmetic number, because the mean of its divisors is an integer number (15200716605061).
Almost surely, 230401433210121 is an apocalyptic number.
It is an amenable number.
30401433210121 is a deficient number, since it is larger than the sum of its proper divisors (1).
30401433210121 is an equidigital number, since it uses as much as digits as its factorization.
30401433210121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 30401433210121 its reverse (12101233410403), we get a palindrome (42502666620524).
The spelling of 30401433210121 in words is "thirty trillion, four hundred one billion, four hundred thirty-three million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •