Base | Representation |
---|---|
bin | 110011010001110101… |
… | …0100010100001000111 |
3 | 101112020110020121220201 |
4 | 1212203222202201013 |
5 | 3301011211120124 |
6 | 122331034111331 |
7 | 10645606504051 |
oct | 1464352424107 |
9 | 345213217821 |
10 | 110120020039 |
11 | 42779975a27 |
12 | 19412b7b547 |
13 | a4cc32cc93 |
14 | 54891068d1 |
15 | 2ce7904144 |
hex | 19a3aa2847 |
110120020039 has 2 divisors, whose sum is σ = 110120020040. Its totient is φ = 110120020038.
The previous prime is 110120019967. The next prime is 110120020061. The reversal of 110120020039 is 930020021011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110120020039 - 211 = 110120017991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110120019998 and 110120020025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110120020069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060010019 + 55060010020.
It is an arithmetic number, because the mean of its divisors is an integer number (55060010020).
Almost surely, 2110120020039 is an apocalyptic number.
110120020039 is a deficient number, since it is larger than the sum of its proper divisors (1).
110120020039 is an equidigital number, since it uses as much as digits as its factorization.
110120020039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
The spelling of 110120020039 in words is "one hundred ten billion, one hundred twenty million, twenty thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •