Base | Representation |
---|---|
bin | 1001100101000110110111… |
… | …0001100001111000001001 |
3 | 1101021221202221202220112102 |
4 | 2121101231301201320021 |
5 | 2340033242441311103 |
6 | 34222501240323145 |
7 | 2134664034410315 |
oct | 231215561417011 |
9 | 41257687686472 |
10 | 10533101510153 |
11 | 33a1077228a82 |
12 | 12214764734b5 |
13 | 5b53620a48a1 |
14 | 285b3a668b45 |
15 | 133ecbae5e88 |
hex | 9946dc61e09 |
10533101510153 has 2 divisors, whose sum is σ = 10533101510154. Its totient is φ = 10533101510152.
The previous prime is 10533101510137. The next prime is 10533101510233. The reversal of 10533101510153 is 35101510133501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7850738874889 + 2682362635264 = 2801917^2 + 1637792^2 .
It is a cyclic number.
It is not a de Polignac number, because 10533101510153 - 24 = 10533101510137 is a prime.
It is a super-2 number, since 2×105331015101532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10533107510153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5266550755076 + 5266550755077.
It is an arithmetic number, because the mean of its divisors is an integer number (5266550755077).
Almost surely, 210533101510153 is an apocalyptic number.
It is an amenable number.
10533101510153 is a deficient number, since it is larger than the sum of its proper divisors (1).
10533101510153 is an equidigital number, since it uses as much as digits as its factorization.
10533101510153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3375, while the sum is 29.
Adding to 10533101510153 its reverse (35101510133501), we get a palindrome (45634611643654).
The spelling of 10533101510153 in words is "ten trillion, five hundred thirty-three billion, one hundred one million, five hundred ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •