Base | Representation |
---|---|
bin | 10010111010011010… |
… | …00011000100100101 |
3 | 222012121212011021112 |
4 | 21131031003010211 |
5 | 131243312324013 |
6 | 4355311354405 |
7 | 506421324464 |
oct | 113515030445 |
9 | 28177764245 |
10 | 10153636133 |
11 | 4340510123 |
12 | 1b74522a05 |
13 | c5a790424 |
14 | 6c47169db |
15 | 3e6609ba8 |
hex | 25d343125 |
10153636133 has 2 divisors, whose sum is σ = 10153636134. Its totient is φ = 10153636132.
The previous prime is 10153636099. The next prime is 10153636147. The reversal of 10153636133 is 33163635101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9075039169 + 1078596964 = 95263^2 + 32842^2 .
It is a cyclic number.
It is not a de Polignac number, because 10153636133 - 212 = 10153632037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10153636133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10153636193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5076818066 + 5076818067.
It is an arithmetic number, because the mean of its divisors is an integer number (5076818067).
Almost surely, 210153636133 is an apocalyptic number.
It is an amenable number.
10153636133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10153636133 is an equidigital number, since it uses as much as digits as its factorization.
10153636133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 32.
The spelling of 10153636133 in words is "ten billion, one hundred fifty-three million, six hundred thirty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •