Base | Representation |
---|---|
bin | 10011011000110011010… |
… | …101000001010011101001 |
3 | 11201100220100101210010112 |
4 | 103120303111001103221 |
5 | 133312023024311103 |
6 | 2500014534224105 |
7 | 165153442506551 |
oct | 23306325012351 |
9 | 4640810353115 |
10 | 1332301010153 |
11 | 474031207203 |
12 | 196260ab5035 |
13 | 988350c93b9 |
14 | 486ab446161 |
15 | 249c9a6ecd8 |
hex | 136335414e9 |
1332301010153 has 2 divisors, whose sum is σ = 1332301010154. Its totient is φ = 1332301010152.
The previous prime is 1332301010077. The next prime is 1332301010179. The reversal of 1332301010153 is 3510101032331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1320541125904 + 11759884249 = 1149148^2 + 108443^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332301010153 - 214 = 1332300993769 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1332301010753) 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, 666150505076 + 666150505077.
It is an arithmetic number, because the mean of its divisors is an integer number (666150505077).
Almost surely, 21332301010153 is an apocalyptic number.
It is an amenable number.
1332301010153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332301010153 is an equidigital number, since it uses as much as digits as its factorization.
1332301010153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 23.
Adding to 1332301010153 its reverse (3510101032331), we get a palindrome (4842402042484).
The spelling of 1332301010153 in words is "one trillion, three hundred thirty-two billion, three hundred one million, ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •