Base | Representation |
---|---|
bin | 11001111110001011100100… |
… | …111000001101101001011001 |
3 | 112222102201121220111021010222 |
4 | 121332023210320031221121 |
5 | 104432422130223223113 |
6 | 1042533512334245425 |
7 | 33026266110054053 |
oct | 3176134470155131 |
9 | 488381556437128 |
10 | 114224200211033 |
11 | 33439236222770 |
12 | 109894b9656875 |
13 | 4b973b0014753 |
14 | 202c6a33d68d3 |
15 | d313784cee08 |
hex | 67e2e4e0da59 |
114224200211033 has 32 divisors (see below), whose sum is σ = 139362787440000. Its totient is φ = 92588149071360.
The previous prime is 114224200210997. The next prime is 114224200211047. The reversal of 114224200211033 is 330112002422411.
It is a happy number.
It is not a de Polignac number, because 114224200211033 - 26 = 114224200210969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114224200210993 and 114224200211011.
It is not an unprimeable number, because it can be changed into a prime (114224200211833) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54593708 + ... + 56647341.
It is an arithmetic number, because the mean of its divisors is an integer number (4355087107500).
Almost surely, 2114224200211033 is an apocalyptic number.
It is an amenable number.
114224200211033 is a deficient number, since it is larger than the sum of its proper divisors (25138587228967).
114224200211033 is a wasteful number, since it uses less digits than its factorization.
114224200211033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111241130 (or 111241096 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 114224200211033 its reverse (330112002422411), we get a palindrome (444336202633444).
The spelling of 114224200211033 in words is "one hundred fourteen trillion, two hundred twenty-four billion, two hundred million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •