Base | Representation |
---|---|
bin | 11001111111010010001110… |
… | …001001001001011000011001 |
3 | 112222200222102022121112021221 |
4 | 121333102032021021120121 |
5 | 104440143002414143140 |
6 | 1043032415313532041 |
7 | 33034622621311015 |
oct | 3177221611113031 |
9 | 488628368545257 |
10 | 114300054443545 |
11 | 33468420a34323 |
12 | 109a0148b74021 |
13 | 4ba15ab27b5b9 |
14 | 203221b715545 |
15 | d33317a3314a |
hex | 67f48e249619 |
114300054443545 has 16 divisors (see below), whose sum is σ = 137404113930000. Its totient is φ = 91277351497728.
The previous prime is 114300054443543. The next prime is 114300054443567. The reversal of 114300054443545 is 545344450003411.
It can be written as a sum of positive squares in 8 ways, for example, as 5688973914649 + 108611080528896 = 2385157^2 + 10421664^2 .
It is a cyclic number.
It is not a de Polignac number, because 114300054443545 - 21 = 114300054443543 is a prime.
It is not an unprimeable number, because it can be changed into a prime (114300054443543) 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 in 15 ways as a sum of consecutive naturals, for example, 137822281 + ... + 138649129.
It is an arithmetic number, because the mean of its divisors is an integer number (8587757120625).
Almost surely, 2114300054443545 is an apocalyptic number.
It is an amenable number.
114300054443545 is a deficient number, since it is larger than the sum of its proper divisors (23104059486455).
114300054443545 is an equidigital number, since it uses as much as digits as its factorization.
114300054443545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 876012.
The product of its (nonzero) digits is 1152000, while the sum is 43.
The spelling of 114300054443545 in words is "one hundred fourteen trillion, three hundred billion, fifty-four million, four hundred forty-three thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •