Base | Representation |
---|---|
bin | 1001110001010010… |
… | …10000001001100000 |
3 | 111112112222010100212 |
4 | 10320221100021200 |
5 | 41220244233230 |
6 | 2224253033252 |
7 | 243661234454 |
oct | 47051201140 |
9 | 14475863325 |
10 | 5245305440 |
11 | 2251924681 |
12 | 1024785828 |
13 | 65791953b |
14 | 37a8b8664 |
15 | 20a75e895 |
hex | 138a50260 |
5245305440 has 48 divisors (see below), whose sum is σ = 12397758912. Its totient is φ = 2097153024.
The previous prime is 5245305389. The next prime is 5245305451. The reversal of 5245305440 is 445035425.
It is a super-3 number, since 3×52453054403 (a number of 30 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 5245305397 and 5245305406.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 412457 + ... + 424983.
It is an arithmetic number, because the mean of its divisors is an integer number (258286644).
Almost surely, 25245305440 is an apocalyptic number.
It is an amenable number.
5245305440 is an abundant number, since it is smaller than the sum of its proper divisors (7152453472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5245305440 is a wasteful number, since it uses less digits than its factorization.
5245305440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15159 (or 15151 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 32.
The square root of 5245305440 is about 72424.4809439460. The cubic root of 5245305440 is about 1737.4951230131.
The spelling of 5245305440 in words is "five billion, two hundred forty-five million, three hundred five thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •