Base | Representation |
---|---|
bin | 11001111110001001111100… |
… | …001001001100100000010101 |
3 | 112222102120002110002111101112 |
4 | 121332021330021030200111 |
5 | 104432410030410231000 |
6 | 1042533022124304405 |
7 | 33026204422351406 |
oct | 3176117411144025 |
9 | 488376073074345 |
10 | 114222443055125 |
11 | 334385143714a9 |
12 | 109890a90a2105 |
13 | 4b9718cc75922 |
14 | 202c577cb39ad |
15 | d312c40db235 |
hex | 67e27c24c815 |
114222443055125 has 8 divisors (see below), whose sum is σ = 142549608932952. Its totient is φ = 91377954444000.
The previous prime is 114222443055113. The next prime is 114222443055131. The reversal of 114222443055125 is 521550344222411.
It can be written as a sum of positive squares in 4 ways, for example, as 8950759535524 + 105271683519601 = 2991782^2 + 10260199^2 .
It is not a de Polignac number, because 114222443055125 - 224 = 114222426277909 is a prime.
It is a Duffinian number.
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, 456889772096 + ... + 456889772345.
It is an arithmetic number, because the mean of its divisors is an integer number (17818701116619).
Almost surely, 2114222443055125 is an apocalyptic number.
It is an amenable number.
114222443055125 is a deficient number, since it is larger than the sum of its proper divisors (28327165877827).
114222443055125 is an frugal number, since it uses more digits than its factorization.
114222443055125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 913779544456 (or 913779544446 counting only the distinct ones).
The product of its (nonzero) digits is 384000, while the sum is 41.
Adding to 114222443055125 its reverse (521550344222411), we get a palindrome (635772787277536).
The spelling of 114222443055125 in words is "one hundred fourteen trillion, two hundred twenty-two billion, four hundred forty-three million, fifty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •