Base | Representation |
---|---|
bin | 1011000000011111001100… |
… | …0101001111101001110001 |
3 | 1120212000221221211200121002 |
4 | 2300013303011033221301 |
5 | 3041243421241024103 |
6 | 41424013021211345 |
7 | 2356261436012141 |
oct | 260076305175161 |
9 | 46760857750532 |
10 | 12103001111153 |
11 | 394694366a157 |
12 | 1435786700b55 |
13 | 69a400bb2534 |
14 | 2dbb07454921 |
15 | 15ec6086d488 |
hex | b01f314fa71 |
12103001111153 has 2 divisors, whose sum is σ = 12103001111154. Its totient is φ = 12103001111152.
The previous prime is 12103001111023. The next prime is 12103001111197. The reversal of 12103001111153 is 35111110030121.
12103001111153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11731837481329 + 371163629824 = 3425177^2 + 609232^2 .
It is a cyclic number.
It is not a de Polignac number, because 12103001111153 - 210 = 12103001110129 is a prime.
It is not a weakly prime, because it can be changed into another prime (12103001111753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051500555576 + 6051500555577.
It is an arithmetic number, because the mean of its divisors is an integer number (6051500555577).
Almost surely, 212103001111153 is an apocalyptic number.
It is an amenable number.
12103001111153 is a deficient number, since it is larger than the sum of its proper divisors (1).
12103001111153 is an equidigital number, since it uses as much as digits as its factorization.
12103001111153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90, while the sum is 20.
Adding to 12103001111153 its reverse (35111110030121), we get a palindrome (47214111141274).
The spelling of 12103001111153 in words is "twelve trillion, one hundred three billion, one million, one hundred eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •