Base | Representation |
---|---|
bin | 1011000000011000100110… |
… | …0010001001001101100101 |
3 | 1120211212101112202021011212 |
4 | 2300012021202021031211 |
5 | 3041231304424131203 |
6 | 41423121202441205 |
7 | 2356166524253324 |
oct | 260061142111545 |
9 | 46755345667155 |
10 | 12101230302053 |
11 | 3946115033062 |
12 | 1435371663205 |
13 | 69a1ab0730b9 |
14 | 2db9ba1ba0bb |
15 | 15ebaa17e1d8 |
hex | b0189889365 |
12101230302053 has 2 divisors, whose sum is σ = 12101230302054. Its totient is φ = 12101230302052.
The previous prime is 12101230302023. The next prime is 12101230302121. The reversal of 12101230302053 is 35020303210121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10714636915684 + 1386593386369 = 3273322^2 + 1177537^2 .
It is a cyclic number.
It is not a de Polignac number, because 12101230302053 - 212 = 12101230297957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12101230302023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6050615151026 + 6050615151027.
It is an arithmetic number, because the mean of its divisors is an integer number (6050615151027).
Almost surely, 212101230302053 is an apocalyptic number.
It is an amenable number.
12101230302053 is a deficient number, since it is larger than the sum of its proper divisors (1).
12101230302053 is an equidigital number, since it uses as much as digits as its factorization.
12101230302053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 12101230302053 its reverse (35020303210121), we get a palindrome (47121533512174).
The spelling of 12101230302053 in words is "twelve trillion, one hundred one billion, two hundred thirty million, three hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •