Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …011001010111010111011111 |
3 | 112102211110100022101201022121 |
4 | 121002022213121113113133 |
5 | 103412334300012010142 |
6 | 1030055124121123411 |
7 | 32122314432444103 |
oct | 3102124731272737 |
9 | 472743308351277 |
10 | 110100000110047 |
11 | 32099169840a42 |
12 | 1042214b329567 |
13 | 4958501b1bccc |
14 | 1d28c22dcd903 |
15 | cade4896ec67 |
hex | 6422a76575df |
110100000110047 has 2 divisors, whose sum is σ = 110100000110048. Its totient is φ = 110100000110046.
The previous prime is 110100000109907. The next prime is 110100000110069. The reversal of 110100000110047 is 740011000001011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110100000110047 - 223 = 110099991721439 is a prime.
It is a super-2 number, since 2×1101000001100472 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110100000110047.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100000110447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050000055023 + 55050000055024.
It is an arithmetic number, because the mean of its divisors is an integer number (55050000055024).
Almost surely, 2110100000110047 is an apocalyptic number.
110100000110047 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100000110047 is an equidigital number, since it uses as much as digits as its factorization.
110100000110047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 110100000110047 its reverse (740011000001011), we get a palindrome (850111000111058).
The spelling of 110100000110047 in words is "one hundred ten trillion, one hundred billion, one hundred ten thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •