Base | Representation |
---|---|
bin | 11001111110001001100100… |
… | …011000100010000110000111 |
3 | 112222102112001122222212021112 |
4 | 121332021210120202012013 |
5 | 104432403221333010120 |
6 | 1042532514404235235 |
7 | 33026161512133310 |
oct | 3176114430420607 |
9 | 488375048885245 |
10 | 114222044422535 |
11 | 3343832a34a985 |
12 | 10988bb769bb1b |
13 | 4b971284c285a |
14 | 202c53ad87607 |
15 | d3129e0e7bc5 |
hex | 67e264622187 |
114222044422535 has 8 divisors (see below), whose sum is σ = 156647375208096. Its totient is φ = 78323687604000.
The previous prime is 114222044422501. The next prime is 114222044422601. The reversal of 114222044422535 is 535224440222411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114222044422535 - 230 = 114220970680711 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114222044422492 and 114222044422501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1631743491716 + ... + 1631743491785.
It is an arithmetic number, because the mean of its divisors is an integer number (19580921901012).
Almost surely, 2114222044422535 is an apocalyptic number.
114222044422535 is a deficient number, since it is larger than the sum of its proper divisors (42425330785561).
114222044422535 is an equidigital number, since it uses as much as digits as its factorization.
114222044422535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3263486983513.
The product of its (nonzero) digits is 614400, while the sum is 41.
Adding to 114222044422535 its reverse (535224440222411), we get a palindrome (649446484644946).
The spelling of 114222044422535 in words is "one hundred fourteen trillion, two hundred twenty-two billion, forty-four million, four hundred twenty-two thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •