Base | Representation |
---|---|
bin | 11001000000101110100001… |
… | …000101100100100100101101 |
3 | 112102111000002111020010210101 |
4 | 121000232201011210210231 |
5 | 103404224233130311112 |
6 | 1025541451243111101 |
7 | 32112214023454012 |
oct | 3100564105444455 |
9 | 472430074203711 |
10 | 110001110010157 |
11 | 32060232972263 |
12 | 10406b51212491 |
13 | 494c0a22484c2 |
14 | 1d24121527709 |
15 | cab5abdc4757 |
hex | 640ba116492d |
110001110010157 has 2 divisors, whose sum is σ = 110001110010158. Its totient is φ = 110001110010156.
The previous prime is 110001110010079. The next prime is 110001110010247. The reversal of 110001110010157 is 751010011100011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70882827609636 + 39118282400521 = 8419194^2 + 6254461^2 .
It is a cyclic number.
It is not a de Polignac number, because 110001110010157 - 227 = 110000975792429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110001110010457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000555005078 + 55000555005079.
It is an arithmetic number, because the mean of its divisors is an integer number (55000555005079).
Almost surely, 2110001110010157 is an apocalyptic number.
It is an amenable number.
110001110010157 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001110010157 is an equidigital number, since it uses as much as digits as its factorization.
110001110010157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35, while the sum is 19.
Adding to 110001110010157 its reverse (751010011100011), we get a palindrome (861011121110168).
The spelling of 110001110010157 in words is "one hundred ten trillion, one billion, one hundred ten million, ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •