Base | Representation |
---|---|
bin | 110011010010001010… |
… | …0100000011000000001 |
3 | 101112021012221112211022 |
4 | 1212210110200120001 |
5 | 3301022020140223 |
6 | 122332105555225 |
7 | 10646102143535 |
oct | 1464424403001 |
9 | 345235845738 |
10 | 110131021313 |
11 | 427850aa395 |
12 | 194167a5b15 |
13 | a5016b2501 |
14 | 548a76bbc5 |
15 | 2ce8878ac8 |
hex | 19a4520601 |
110131021313 has 2 divisors, whose sum is σ = 110131021314. Its totient is φ = 110131021312.
The previous prime is 110131021303. The next prime is 110131021331. The reversal of 110131021313 is 313120131011.
Together with next prime (110131021331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102670898929 + 7460122384 = 320423^2 + 86372^2 .
It is a cyclic number.
It is not a de Polignac number, because 110131021313 - 28 = 110131021057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110131021291 and 110131021300.
It is not a weakly prime, because it can be changed into another prime (110131021303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55065510656 + 55065510657.
It is an arithmetic number, because the mean of its divisors is an integer number (55065510657).
Almost surely, 2110131021313 is an apocalyptic number.
It is an amenable number.
110131021313 is a deficient number, since it is larger than the sum of its proper divisors (1).
110131021313 is an equidigital number, since it uses as much as digits as its factorization.
110131021313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 110131021313 its reverse (313120131011), we get a palindrome (423251152324).
The spelling of 110131021313 in words is "one hundred ten billion, one hundred thirty-one million, twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •