Base | Representation |
---|---|
bin | 11001000001000000011000… |
… | …111110001100001000011001 |
3 | 112102112211121221212002222211 |
4 | 121001000120332030020121 |
5 | 103410033034102211022 |
6 | 1025554343441115121 |
7 | 32113463425123243 |
oct | 3101003076141031 |
9 | 472484557762884 |
10 | 110020301210137 |
11 | 3206839089a90a |
12 | 1040a808328aa1 |
13 | 4950b401ab936 |
14 | 1d25022233093 |
15 | cabd31b2ae77 |
hex | 641018f8c219 |
110020301210137 has 2 divisors, whose sum is σ = 110020301210138. Its totient is φ = 110020301210136.
The previous prime is 110020301210129. The next prime is 110020301210147. The reversal of 110020301210137 is 731012103020011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101224948445721 + 8795352764416 = 10061061^2 + 2965696^2 .
It is a cyclic number.
It is not a de Polignac number, because 110020301210137 - 23 = 110020301210129 is a prime.
It is not a weakly prime, because it can be changed into another prime (110020301210147) 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, 55010150605068 + 55010150605069.
It is an arithmetic number, because the mean of its divisors is an integer number (55010150605069).
Almost surely, 2110020301210137 is an apocalyptic number.
It is an amenable number.
110020301210137 is a deficient number, since it is larger than the sum of its proper divisors (1).
110020301210137 is an equidigital number, since it uses as much as digits as its factorization.
110020301210137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 110020301210137 its reverse (731012103020011), we get a palindrome (841032404230148).
The spelling of 110020301210137 in words is "one hundred ten trillion, twenty billion, three hundred one million, two hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •