Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0100001001001011011 |
3 | 101111221011021211120001 |
4 | 1212130210201021123 |
5 | 3300240224013201 |
6 | 122311143113431 |
7 | 10642633036654 |
oct | 1463444411133 |
9 | 344834254501 |
10 | 110001001051 |
11 | 42718774227 |
12 | 1939b142877 |
13 | a4b078a746 |
14 | 54773a452b |
15 | 2cdc244301 |
hex | 199c92125b |
110001001051 has 2 divisors, whose sum is σ = 110001001052. Its totient is φ = 110001001050.
The previous prime is 110001001013. The next prime is 110001001067. The reversal of 110001001051 is 150100100011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110001001051 - 29 = 110001000539 is a prime.
It is not a weakly prime, because it can be changed into another prime (110001001081) 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, 55000500525 + 55000500526.
It is an arithmetic number, because the mean of its divisors is an integer number (55000500526).
Almost surely, 2110001001051 is an apocalyptic number.
110001001051 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001001051 is an equidigital number, since it uses as much as digits as its factorization.
110001001051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 110001001051 its reverse (150100100011), we get a palindrome (260101101062).
The spelling of 110001001051 in words is "one hundred ten billion, one million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •