Base | Representation |
---|---|
bin | 11001000110111111001100… |
… | …001101011100100000001011 |
3 | 112111000010120021110102221201 |
4 | 121012333030031130200023 |
5 | 103433301331014133024 |
6 | 1030511241443245031 |
7 | 32155254211111111 |
oct | 3106771415344013 |
9 | 474003507412851 |
10 | 110431330224139 |
11 | 32206733a77711 |
12 | 104763b9079777 |
13 | 4980825762862 |
14 | 1d3ac95099ab1 |
15 | cb788b8e5744 |
hex | 646fcc35c80b |
110431330224139 has 2 divisors, whose sum is σ = 110431330224140. Its totient is φ = 110431330224138.
The previous prime is 110431330224113. The next prime is 110431330224217. The reversal of 110431330224139 is 931422033134011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110431330224139 - 219 = 110431329699851 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110431330224098 and 110431330224107.
It is not a weakly prime, because it can be changed into another prime (110431330224739) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55215665112069 + 55215665112070.
It is an arithmetic number, because the mean of its divisors is an integer number (55215665112070).
Almost surely, 2110431330224139 is an apocalyptic number.
110431330224139 is a deficient number, since it is larger than the sum of its proper divisors (1).
110431330224139 is an equidigital number, since it uses as much as digits as its factorization.
110431330224139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 37.
The spelling of 110431330224139 in words is "one hundred ten trillion, four hundred thirty-one billion, three hundred thirty million, two hundred twenty-four thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •