Base | Representation |
---|---|
bin | 10010110101110101… |
… | …11100010001011101 |
3 | 222002221210021100201 |
4 | 21122322330101131 |
5 | 131204011212021 |
6 | 4351422423501 |
7 | 505444634233 |
oct | 113272742135 |
9 | 28087707321 |
10 | 10115335261 |
11 | 4320930109 |
12 | 1b63731b91 |
13 | c528700a5 |
14 | 6bd5c6953 |
15 | 3e3091591 |
hex | 25aebc45d |
10115335261 has 2 divisors, whose sum is σ = 10115335262. Its totient is φ = 10115335260.
The previous prime is 10115335229. The next prime is 10115335271. The reversal of 10115335261 is 16253351101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8450205625 + 1665129636 = 91925^2 + 40806^2 .
It is a cyclic number.
It is not a de Polignac number, because 10115335261 - 25 = 10115335229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10115335271) 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, 5057667630 + 5057667631.
It is an arithmetic number, because the mean of its divisors is an integer number (5057667631).
Almost surely, 210115335261 is an apocalyptic number.
It is an amenable number.
10115335261 is a deficient number, since it is larger than the sum of its proper divisors (1).
10115335261 is an equidigital number, since it uses as much as digits as its factorization.
10115335261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 28.
Adding to 10115335261 its reverse (16253351101), we get a palindrome (26368686362).
The spelling of 10115335261 in words is "ten billion, one hundred fifteen million, three hundred thirty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •