Base | Representation |
---|---|
bin | 10100110011010101010100 |
3 | 101021001022011 |
4 | 110303111110 |
5 | 2344000030 |
6 | 312514004 |
7 | 64231240 |
oct | 24632524 |
9 | 11231264 |
10 | 5453140 |
11 | 3095030 |
12 | 19ab904 |
13 | 118c114 |
14 | a1d420 |
15 | 72ab2a |
hex | 533554 |
5453140 has 48 divisors (see below), whose sum is σ = 14281344. Its totient is φ = 1699200.
The previous prime is 5453113. The next prime is 5453143. The reversal of 5453140 is 413545.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5453143) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 231 + ... + 3310.
It is an arithmetic number, because the mean of its divisors is an integer number (297528).
Almost surely, 25453140 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5453140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7140672).
5453140 is an abundant number, since it is smaller than the sum of its proper divisors (8828204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5453140 is a wasteful number, since it uses less digits than its factorization.
5453140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3568 (or 3566 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 5453140 is about 2335.1959232578. The cubic root of 5453140 is about 176.0146768064.
Adding to 5453140 its reverse (413545), we get a palindrome (5866685).
The spelling of 5453140 in words is "five million, four hundred fifty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •