Base | Representation |
---|---|
bin | 1101011010001… |
… | …0110011111101 |
3 | 10220211100201000 |
4 | 3112202303331 |
5 | 103344211110 |
6 | 5325240513 |
7 | 1252021053 |
oct | 326426375 |
9 | 126740630 |
10 | 56241405 |
11 | 29824000 |
12 | 16a03139 |
13 | b86224c |
14 | 76801d3 |
15 | 4e0e1c0 |
hex | 35a2cfd |
56241405 has 64 divisors (see below), whose sum is σ = 110327040. Its totient is φ = 27181440.
The previous prime is 56241403. The next prime is 56241407. The reversal of 56241405 is 50414265.
It is an interprime number because it is at equal distance from previous prime (56241403) and next prime (56241407).
It is not a de Polignac number, because 56241405 - 21 = 56241403 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56241403) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 179529 + ... + 179841.
It is an arithmetic number, because the mean of its divisors is an integer number (1723860).
Almost surely, 256241405 is an apocalyptic number.
56241405 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56241405 is a deficient number, since it is larger than the sum of its proper divisors (54085635).
56241405 is a wasteful number, since it uses less digits than its factorization.
56241405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 360 (or 332 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 56241405 is about 7499.4269781097. The cubic root of 56241405 is about 383.1351998558.
The spelling of 56241405 in words is "fifty-six million, two hundred forty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •