Base | Representation |
---|---|
bin | 10011100011110100… |
… | …10111011000111001 |
3 | 1000002211121010102211 |
4 | 21301322113120321 |
5 | 133001232411103 |
6 | 4454002055121 |
7 | 521140352503 |
oct | 116172273071 |
9 | 30084533384 |
10 | 10501060153 |
11 | 44a9635a11 |
12 | 205094a4a1 |
13 | cb4753c7c |
14 | 718912d73 |
15 | 416d8536d |
hex | 271e97639 |
10501060153 has 2 divisors, whose sum is σ = 10501060154. Its totient is φ = 10501060152.
The previous prime is 10501060127. The next prime is 10501060177. The reversal of 10501060153 is 35106010501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5406955024 + 5094105129 = 73532^2 + 71373^2 .
It is an emirp because it is prime and its reverse (35106010501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10501060153 - 25 = 10501060121 is a prime.
It is a super-2 number, since 2×105010601532 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10501060553) 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, 5250530076 + 5250530077.
It is an arithmetic number, because the mean of its divisors is an integer number (5250530077).
Almost surely, 210501060153 is an apocalyptic number.
It is an amenable number.
10501060153 is a deficient number, since it is larger than the sum of its proper divisors (1).
10501060153 is an equidigital number, since it uses as much as digits as its factorization.
10501060153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 22.
Adding to 10501060153 its reverse (35106010501), we get a palindrome (45607070654).
The spelling of 10501060153 in words is "ten billion, five hundred one million, sixty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •