Base | Representation |
---|---|
bin | 10010111111111100… |
… | …10101010001001001 |
3 | 222022212022021122112 |
4 | 21133332111101021 |
5 | 131342212011103 |
6 | 4404051432105 |
7 | 510524335322 |
oct | 113776252111 |
9 | 28285267575 |
10 | 10200110153 |
11 | 4364772802 |
12 | 1b87bb5635 |
13 | c672b294c |
14 | 6ca973449 |
15 | 3ea739cd8 |
hex | 25ff95449 |
10200110153 has 2 divisors, whose sum is σ = 10200110154. Its totient is φ = 10200110152.
The previous prime is 10200110077. The next prime is 10200110197. The reversal of 10200110153 is 35101100201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9063611209 + 1136498944 = 95203^2 + 33712^2 .
It is an emirp because it is prime and its reverse (35101100201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10200110153 - 220 = 10199061577 is a prime.
It is not a weakly prime, because it can be changed into another prime (10200110353) 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, 5100055076 + 5100055077.
It is an arithmetic number, because the mean of its divisors is an integer number (5100055077).
Almost surely, 210200110153 is an apocalyptic number.
It is an amenable number.
10200110153 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200110153 is an equidigital number, since it uses as much as digits as its factorization.
10200110153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 10200110153 its reverse (35101100201), we get a palindrome (45301210354).
The spelling of 10200110153 in words is "ten billion, two hundred million, one hundred ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •