Base | Representation |
---|---|
bin | 1010011011001001… |
… | …11000110001110000 |
3 | 112110000202202222000 |
4 | 11031210320301300 |
5 | 42430144421142 |
6 | 2323200014000 |
7 | 255454214004 |
oct | 51544706160 |
9 | 15400682860 |
10 | 5596482672 |
11 | 24120832a0 |
12 | 1102301300 |
13 | 6b25c5511 |
14 | 3b13b0704 |
15 | 22b4cc14c |
hex | 14d938c70 |
5596482672 has 80 divisors (see below), whose sum is σ = 17524354560. Its totient is φ = 1695902400.
The previous prime is 5596482667. The next prime is 5596482677. The reversal of 5596482672 is 2762846955.
5596482672 is a `hidden beast` number, since 5 + 5 + 96 + 482 + 6 + 72 = 666.
It is an interprime number because it is at equal distance from previous prime (5596482667) and next prime (5596482677).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5596482677) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 584104 + ... + 593607.
It is an arithmetic number, because the mean of its divisors is an integer number (219054432).
Almost surely, 25596482672 is an apocalyptic number.
It is an amenable number.
5596482672 is an abundant number, since it is smaller than the sum of its proper divisors (11927871888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5596482672 is a wasteful number, since it uses less digits than its factorization.
5596482672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1177739 (or 1177727 counting only the distinct ones).
The product of its digits is 7257600, while the sum is 54.
The square root of 5596482672 is about 74809.6429078498. The cubic root of 5596482672 is about 1775.4361339981.
The spelling of 5596482672 in words is "five billion, five hundred ninety-six million, four hundred eighty-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •