Base | Representation |
---|---|
bin | 1100101001011… |
… | …0100010100000 |
3 | 10200210222121202 |
4 | 3022112202200 |
5 | 102034423113 |
6 | 5132540332 |
7 | 1212610223 |
oct | 312264240 |
9 | 120728552 |
10 | 53045408 |
11 | 27a40889 |
12 | 159216a8 |
13 | acb3620 |
14 | 708b5ba |
15 | 49cc258 |
hex | 32968a0 |
53045408 has 48 divisors (see below), whose sum is σ = 116371080. Its totient is φ = 23632896.
The previous prime is 53045407. The next prime is 53045411. The reversal of 53045408 is 80454035.
It can be written as a sum of positive squares in 4 ways, for example, as 36820624 + 16224784 = 6068^2 + 4028^2 .
It is a Harshad number since it is a multiple of its sum of digits (29).
It is not an unprimeable number, because it can be changed into a prime (53045401) 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, 9866 + ... + 14262.
Almost surely, 253045408 is an apocalyptic number.
53045408 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53045408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58185540).
53045408 is an abundant number, since it is smaller than the sum of its proper divisors (63325672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53045408 is a wasteful number, since it uses less digits than its factorization.
53045408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4449 (or 4441 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 29.
The square root of 53045408 is about 7283.2278558343. The cubic root of 53045408 is about 375.7358186522.
The spelling of 53045408 in words is "fifty-three million, forty-five thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •