Base | Representation |
---|---|
bin | 10010111110111000… |
… | …00000001010010001 |
3 | 222022020101001212012 |
4 | 21133130000022101 |
5 | 131332411021201 |
6 | 4403130512305 |
7 | 510355004204 |
oct | 113734001221 |
9 | 28266331765 |
10 | 10191110801 |
11 | 435a686423 |
12 | 1b84b95695 |
13 | c654816a1 |
14 | 6c96ad93b |
15 | 3e9a5d5bb |
hex | 25f700291 |
10191110801 has 2 divisors, whose sum is σ = 10191110802. Its totient is φ = 10191110800.
The previous prime is 10191110789. The next prime is 10191110803. The reversal of 10191110801 is 10801119101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10191104401 + 6400 = 100951^2 + 80^2 .
It is an emirp because it is prime and its reverse (10801119101) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 10801116101 and 10161110801.
It is a cyclic number.
It is not a de Polignac number, because 10191110801 - 222 = 10186916497 is a prime.
Together with 10191110803, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10191110803) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5095555400 + 5095555401.
It is an arithmetic number, because the mean of its divisors is an integer number (5095555401).
Almost surely, 210191110801 is an apocalyptic number.
It is an amenable number.
10191110801 is a deficient number, since it is larger than the sum of its proper divisors (1).
10191110801 is an equidigital number, since it uses as much as digits as its factorization.
10191110801 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 23.
Adding to 10191110801 its reverse (10801119101), we get a palindrome (20992229902).
The spelling of 10191110801 in words is "ten billion, one hundred ninety-one million, one hundred ten thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •