Base | Representation |
---|---|
bin | 1101011100111… |
… | …0111000011011 |
3 | 10221011112022120 |
4 | 3113032320123 |
5 | 103421000130 |
6 | 5333152323 |
7 | 1253402244 |
oct | 327167033 |
9 | 127145276 |
10 | 56421915 |
11 | 29937690 |
12 | 16a8b6a3 |
13 | b8c6464 |
14 | 76c9ccb |
15 | 4e47910 |
hex | 35cee1b |
56421915 has 16 divisors (see below), whose sum is σ = 98482176. Its totient is φ = 27356000.
The previous prime is 56421913. The next prime is 56421923. The reversal of 56421915 is 51912465.
56421915 = T1561 + T1562 + ... + T1605.
It is not a de Polignac number, because 56421915 - 21 = 56421913 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (56421913) 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, 170811 + ... + 171140.
It is an arithmetic number, because the mean of its divisors is an integer number (6155136).
Almost surely, 256421915 is an apocalyptic number.
56421915 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
56421915 is a deficient number, since it is larger than the sum of its proper divisors (42060261).
56421915 is a wasteful number, since it uses less digits than its factorization.
56421915 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 341970.
The product of its digits is 10800, while the sum is 33.
The square root of 56421915 is about 7511.4522563882. The cubic root of 56421915 is about 383.5446602043.
It can be divided in two parts, 5642 and 1915, that added together give a palindrome (7557).
The spelling of 56421915 in words is "fifty-six million, four hundred twenty-one thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •