Base | Representation |
---|---|
bin | 11010000001000110101111… |
… | …010000110001101110111001 |
3 | 120000010221100102120210110112 |
4 | 122001012233100301232321 |
5 | 104444220214010043140 |
6 | 1043210110020554105 |
7 | 33046642144232663 |
oct | 3201065720615671 |
9 | 500127312523415 |
10 | 114425164143545 |
11 | 33506492112702 |
12 | 10a00443b52935 |
13 | 4bb0328c53198 |
14 | 20382c9517533 |
15 | d366db3adc65 |
hex | 6811af431bb9 |
114425164143545 has 8 divisors (see below), whose sum is σ = 139637488446720. Its totient is φ = 89988603665200.
The previous prime is 114425164143539. The next prime is 114425164143569. The reversal of 114425164143545 is 545341461524411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114425164143545 - 216 = 114425164078009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114425164143493 and 114425164143502.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 193940955881 + ... + 193940956470.
It is an arithmetic number, because the mean of its divisors is an integer number (17454686055840).
Almost surely, 2114425164143545 is an apocalyptic number.
It is an amenable number.
114425164143545 is a deficient number, since it is larger than the sum of its proper divisors (25212324303175).
114425164143545 is an equidigital number, since it uses as much as digits as its factorization.
114425164143545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387881912415.
The product of its digits is 4608000, while the sum is 50.
The spelling of 114425164143545 in words is "one hundred fourteen trillion, four hundred twenty-five billion, one hundred sixty-four million, one hundred forty-three thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •