Base | Representation |
---|---|
bin | 11001111110001001100100… |
… | …011000100100011011000111 |
3 | 112222102112001200000100100201 |
4 | 121332021210120210123013 |
5 | 104432403221333311241 |
6 | 1042532514404351331 |
7 | 33026161512203152 |
oct | 3176114430443307 |
9 | 488375050010321 |
10 | 114222044432071 |
11 | 3343832a357064 |
12 | 10988bb76a5547 |
13 | 4b971284c6cb4 |
14 | 202c53ad8ac99 |
15 | d3129e0ea931 |
hex | 67e2646246c7 |
114222044432071 has 2 divisors, whose sum is σ = 114222044432072. Its totient is φ = 114222044432070.
The previous prime is 114222044432009. The next prime is 114222044432081. The reversal of 114222044432071 is 170234440222411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114222044432071 - 227 = 114221910214343 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114222044432071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114222044432081) 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, 57111022216035 + 57111022216036.
It is an arithmetic number, because the mean of its divisors is an integer number (57111022216036).
Almost surely, 2114222044432071 is an apocalyptic number.
114222044432071 is a deficient number, since it is larger than the sum of its proper divisors (1).
114222044432071 is an equidigital number, since it uses as much as digits as its factorization.
114222044432071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86016, while the sum is 37.
Adding to 114222044432071 its reverse (170234440222411), we get a palindrome (284456484654482).
The spelling of 114222044432071 in words is "one hundred fourteen trillion, two hundred twenty-two billion, forty-four million, four hundred thirty-two thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •