Base | Representation |
---|---|
bin | 10010101000001101… |
… | …10100110111000001 |
3 | 221210222122221201222 |
4 | 21110012310313001 |
5 | 130440224310423 |
6 | 4332220204425 |
7 | 502556116613 |
oct | 112406646701 |
9 | 27728587658 |
10 | 10001010113 |
11 | 4272344a16 |
12 | 1b31399715 |
13 | c34c82183 |
14 | 6ac346db3 |
15 | 3d800c3c8 |
hex | 2541b4dc1 |
10001010113 has 2 divisors, whose sum is σ = 10001010114. Its totient is φ = 10001010112.
The previous prime is 10001010079. The next prime is 10001010139. The reversal of 10001010113 is 31101010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7766368129 + 2234641984 = 88127^2 + 47272^2 .
It is a cyclic number.
It is not a de Polignac number, because 10001010113 - 212 = 10001006017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10001010113.
It is not a weakly prime, because it can be changed into another prime (10001010143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000505056 + 5000505057.
It is an arithmetic number, because the mean of its divisors is an integer number (5000505057).
Almost surely, 210001010113 is an apocalyptic number.
It is an amenable number.
10001010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001010113 is an equidigital number, since it uses as much as digits as its factorization.
10001010113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 10001010113 its reverse (31101010001), we get a palindrome (41102020114).
The spelling of 10001010113 in words is "ten billion, one million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •