Base | Representation |
---|---|
bin | 11101011001011110011… |
… | …11110111000101101001 |
3 | 10120120021022011201022112 |
4 | 32230233033313011221 |
5 | 113022201130022023 |
6 | 2052012122532105 |
7 | 132656316230054 |
oct | 16545717670551 |
9 | 3516238151275 |
10 | 1010110001513 |
11 | 35a426842748 |
12 | 143923967035 |
13 | 743399bbc62 |
14 | 36c65041a9b |
15 | 1b41e102478 |
hex | eb2f3f7169 |
1010110001513 has 2 divisors, whose sum is σ = 1010110001514. Its totient is φ = 1010110001512.
The previous prime is 1010110001471. The next prime is 1010110001561. The reversal of 1010110001513 is 3151000110101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 997787225449 + 12322776064 = 998893^2 + 111008^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010110001513 - 222 = 1010105807209 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1010110001113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505055000756 + 505055000757.
It is an arithmetic number, because the mean of its divisors is an integer number (505055000757).
Almost surely, 21010110001513 is an apocalyptic number.
It is an amenable number.
1010110001513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010110001513 is an equidigital number, since it uses as much as digits as its factorization.
1010110001513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15, while the sum is 14.
Adding to 1010110001513 its reverse (3151000110101), we get a palindrome (4161110111614).
The spelling of 1010110001513 in words is "one trillion, ten billion, one hundred ten million, one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •