Base | Representation |
---|---|
bin | 110011010010100101… |
… | …0001110010100101011 |
3 | 101112022012102222110201 |
4 | 1212211022032110223 |
5 | 3301034121300042 |
6 | 122333331453031 |
7 | 10646332633462 |
oct | 1464512162453 |
9 | 345265388421 |
10 | 110145103147 |
11 | 42792048272 |
12 | 1941b457177 |
13 | a5045a2c61 |
14 | 548c5959d9 |
15 | 2ce9c0b1b7 |
hex | 19a528e52b |
110145103147 has 2 divisors, whose sum is σ = 110145103148. Its totient is φ = 110145103146.
The previous prime is 110145103111. The next prime is 110145103153. The reversal of 110145103147 is 741301541011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110145103147 is a prime.
It is not a weakly prime, because it can be changed into another prime (110146103147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55072551573 + 55072551574.
It is an arithmetic number, because the mean of its divisors is an integer number (55072551574).
Almost surely, 2110145103147 is an apocalyptic number.
110145103147 is a deficient number, since it is larger than the sum of its proper divisors (1).
110145103147 is an equidigital number, since it uses as much as digits as its factorization.
110145103147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1680, while the sum is 28.
Adding to 110145103147 its reverse (741301541011), we get a palindrome (851446644158).
The spelling of 110145103147 in words is "one hundred ten billion, one hundred forty-five million, one hundred three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •