Base | Representation |
---|---|
bin | 111110111110111110111001… |
… | …0111110101101011101111101 |
3 | 2200122121020010002101000100222 |
4 | 1331331331302332231131331 |
5 | 1040103431241203121000 |
6 | 5242142313223431125 |
7 | 224460123521506004 |
oct | 17575756276553575 |
9 | 2618536102330328 |
10 | 554014055520125 |
11 | 150587050251862 |
12 | 521777762b54a5 |
13 | 1aa193bbb600b5 |
14 | 9ab45cd9adc3b |
15 | 440b29c466a85 |
hex | 1f7df72fad77d |
554014055520125 has 32 divisors (see below), whose sum is σ = 693304238525184. Its totient is φ = 441998227704000.
The previous prime is 554014055520119. The next prime is 554014055520161. The reversal of 554014055520125 is 521025550410455.
It is a happy number.
It is not a de Polignac number, because 554014055520125 - 212 = 554014055516029 is a prime.
It is a super-2 number, since 2×5540140555201252 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (37) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68471672 + ... + 76134078.
It is an arithmetic number, because the mean of its divisors is an integer number (21665757453912).
Almost surely, 2554014055520125 is an apocalyptic number.
It is an amenable number.
554014055520125 is a deficient number, since it is larger than the sum of its proper divisors (139290183005059).
554014055520125 is a wasteful number, since it uses less digits than its factorization.
554014055520125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7664006 (or 7663996 counting only the distinct ones).
The product of its (nonzero) digits is 1000000, while the sum is 44.
The spelling of 554014055520125 in words is "five hundred fifty-four trillion, fourteen billion, fifty-five million, five hundred twenty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •