Base | Representation |
---|---|
bin | 111111010000110010011101… |
… | …1011101100100000110000000 |
3 | 2200222021011202122202201222201 |
4 | 1332201210323131210012000 |
5 | 1040414030122343132231 |
6 | 5251254434403042544 |
7 | 225131666440601113 |
oct | 17641447335440600 |
9 | 2628234678681881 |
10 | 556461255442816 |
11 | 15133a990867509 |
12 | 524b1b04670454 |
13 | 1ab660c0649029 |
14 | 9b5ac2310c57a |
15 | 444ec7a980161 |
hex | 1fa193b764180 |
556461255442816 has 64 divisors (see below), whose sum is σ = 1175719212190080. Its totient is φ = 261432712470528.
The previous prime is 556461255442801. The next prime is 556461255442823. The reversal of 556461255442816 is 618244552164655.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a congruent number.
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, 209327175 + ... + 211968838.
It is an arithmetic number, because the mean of its divisors is an integer number (18370612690470).
Almost surely, 2556461255442816 is an apocalyptic number.
It is an amenable number.
556461255442816 is an abundant number, since it is smaller than the sum of its proper divisors (619257956747264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556461255442816 is a wasteful number, since it uses less digits than its factorization.
556461255442816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421296651 (or 421296639 counting only the distinct ones).
The product of its digits is 276480000, while the sum is 64.
The spelling of 556461255442816 in words is "five hundred fifty-six trillion, four hundred sixty-one billion, two hundred fifty-five million, four hundred forty-two thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •