Base | Representation |
---|---|
bin | 111110111111111010000000… |
… | …1110010100000001101010001 |
3 | 2200200001100210110011212112102 |
4 | 1331333310001302200031101 |
5 | 1040113021234402413203 |
6 | 5242320510310410145 |
7 | 224502236461604633 |
oct | 17577640162401521 |
9 | 2620040713155472 |
10 | 554141005513553 |
11 | 1506259762058a7 |
12 | 521982a5660955 |
13 | 1aa28370b91cc3 |
14 | 9aba7d3d76a53 |
15 | 440e72c659888 |
hex | 1f7fd01ca0351 |
554141005513553 has 8 divisors (see below), whose sum is σ = 554771204892576. Its totient is φ = 553510928581600.
The previous prime is 554141005513523. The next prime is 554141005513591. The reversal of 554141005513553 is 355315500141455.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 554141005513553 - 220 = 554141004464977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 554141005513498 and 554141005513507.
It is not an unprimeable number, because it can be changed into a prime (554141005513523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21553988 + ... + 39659253.
It is an arithmetic number, because the mean of its divisors is an integer number (69346400611572).
Almost surely, 2554141005513553 is an apocalyptic number.
It is an amenable number.
554141005513553 is a deficient number, since it is larger than the sum of its proper divisors (630199379023).
554141005513553 is an equidigital number, since it uses as much as digits as its factorization.
554141005513553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61223535.
The product of its (nonzero) digits is 2250000, while the sum is 47.
The spelling of 554141005513553 in words is "five hundred fifty-four trillion, one hundred forty-one billion, five million, five hundred thirteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •