Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …1111100001100101110101 |
3 | 1022202120010110211022012122 |
4 | 2102332130333201211311 |
5 | 2310440002103330003 |
6 | 33251531154325325 |
7 | 2061464641402562 |
oct | 222763477414565 |
9 | 38676113738178 |
10 | 10100102011253 |
11 | 324447a304741 |
12 | 1171573889845 |
13 | 583587b34047 |
14 | 26cbc1945869 |
15 | 127ad80cd238 |
hex | 92f9cfe1975 |
10100102011253 has 2 divisors, whose sum is σ = 10100102011254. Its totient is φ = 10100102011252.
The previous prime is 10100102011199. The next prime is 10100102011289. The reversal of 10100102011253 is 35211020100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9470772361444 + 629329649809 = 3077462^2 + 793303^2 .
It is an emirp because it is prime and its reverse (35211020100101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100102011253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100102011453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050051005626 + 5050051005627.
It is an arithmetic number, because the mean of its divisors is an integer number (5050051005627).
Almost surely, 210100102011253 is an apocalyptic number.
It is an amenable number.
10100102011253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100102011253 is an equidigital number, since it uses as much as digits as its factorization.
10100102011253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 10100102011253 its reverse (35211020100101), we get a palindrome (45311122111354).
The spelling of 10100102011253 in words is "ten trillion, one hundred billion, one hundred two million, eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •