Base | Representation |
---|---|
bin | 1101110000001000011100… |
… | …01100111110000011010101 |
3 | 10222002000120110112210120021 |
4 | 12320010032030332003111 |
5 | 12430432234332341203 |
6 | 144152323153305141 |
7 | 6240563503233463 |
oct | 670041614760325 |
9 | 128060513483507 |
10 | 30241103012053 |
11 | 96aa1a82a25aa |
12 | 3484b182651b1 |
13 | 13b49541a761b |
14 | 76796a31d833 |
15 | 3769919b35bd |
hex | 1b810e33e0d5 |
30241103012053 has 2 divisors, whose sum is σ = 30241103012054. Its totient is φ = 30241103012052.
The previous prime is 30241103012011. The next prime is 30241103012129. The reversal of 30241103012053 is 35021030114203.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30162140888049 + 78962124004 = 5492007^2 + 281002^2 .
It is a cyclic number.
It is not a de Polignac number, because 30241103012053 - 229 = 30240566141141 is a prime.
It is a super-2 number, since 2×302411030120532 (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 (30241103082053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15120551506026 + 15120551506027.
It is an arithmetic number, because the mean of its divisors is an integer number (15120551506027).
Almost surely, 230241103012053 is an apocalyptic number.
It is an amenable number.
30241103012053 is a deficient number, since it is larger than the sum of its proper divisors (1).
30241103012053 is an equidigital number, since it uses as much as digits as its factorization.
30241103012053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 30241103012053 its reverse (35021030114203), we get a palindrome (65262133126256).
The spelling of 30241103012053 in words is "thirty trillion, two hundred forty-one billion, one hundred three million, twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •