Base | Representation |
---|---|
bin | 11001000000101110011010… |
… | …100010010101101110010001 |
3 | 112102110222210211102200110222 |
4 | 121000232122202111232101 |
5 | 103404224022012022433 |
6 | 1025541432315402425 |
7 | 32112211220362205 |
oct | 3100563242255621 |
9 | 472428724380428 |
10 | 110001000110993 |
11 | 3206018692a402 |
12 | 10406b20453415 |
13 | 494c08554a004 |
14 | 1d24110abab05 |
15 | cab5a2416b98 |
hex | 640b9a895b91 |
110001000110993 has 2 divisors, whose sum is σ = 110001000110994. Its totient is φ = 110001000110992.
The previous prime is 110001000110923. The next prime is 110001000111019. The reversal of 110001000110993 is 399011000100011.
It is a happy number.
It is an a-pointer prime, because the next prime (110001000111019) can be obtained adding 110001000110993 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106224107154064 + 3776892956929 = 10306508^2 + 1943423^2 .
It is a cyclic number.
It is not a de Polignac number, because 110001000110993 - 216 = 110001000045457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110001000110923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000500055496 + 55000500055497.
It is an arithmetic number, because the mean of its divisors is an integer number (55000500055497).
Almost surely, 2110001000110993 is an apocalyptic number.
It is an amenable number.
110001000110993 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001000110993 is an equidigital number, since it uses as much as digits as its factorization.
110001000110993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 26.
The spelling of 110001000110993 in words is "one hundred ten trillion, one billion, one hundred ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •