Base | Representation |
---|---|
bin | 110011001111111011… |
… | …0010101110111110011 |
3 | 101112001222210022221022 |
4 | 1212133312111313303 |
5 | 3300343314130412 |
6 | 122320430050055 |
7 | 10644201415436 |
oct | 1463766256763 |
9 | 345058708838 |
10 | 110056005107 |
11 | 42746822624 |
12 | 193b564992b |
13 | a4bbca8719 |
14 | 548080181d |
15 | 2ce1eaba72 |
hex | 199fd95df3 |
110056005107 has 2 divisors, whose sum is σ = 110056005108. Its totient is φ = 110056005106.
The previous prime is 110056005071. The next prime is 110056005113. The reversal of 110056005107 is 701500650011.
Together with previous prime (110056005071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110056005107 is a prime.
It is a super-2 number, since 2×1100560051072 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110056005197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55028002553 + 55028002554.
It is an arithmetic number, because the mean of its divisors is an integer number (55028002554).
Almost surely, 2110056005107 is an apocalyptic number.
110056005107 is a deficient number, since it is larger than the sum of its proper divisors (1).
110056005107 is an equidigital number, since it uses as much as digits as its factorization.
110056005107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1050, while the sum is 26.
Adding to 110056005107 its reverse (701500650011), we get a palindrome (811556655118).
The spelling of 110056005107 in words is "one hundred ten billion, fifty-six million, five thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •