Base | Representation |
---|---|
bin | 1101011000000… |
… | …1111111111010 |
3 | 10220120112100010 |
4 | 3112001333322 |
5 | 103330411002 |
6 | 5322322350 |
7 | 1250621160 |
oct | 326017772 |
9 | 126515303 |
10 | 56107002 |
11 | 29742026 |
12 | 169593b6 |
13 | b816013 |
14 | 7647230 |
15 | 4dd446c |
hex | 3581ffa |
56107002 has 64 divisors (see below), whose sum is σ = 134221824. Its totient is φ = 15301440.
The previous prime is 56107001. The next prime is 56107043. The reversal of 56107002 is 20070165.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 56107002.
It is not an unprimeable number, because it can be changed into a prime (56107001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84552 + ... + 85212.
It is an arithmetic number, because the mean of its divisors is an integer number (2097216).
Almost surely, 256107002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56107002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67110912).
56107002 is an abundant number, since it is smaller than the sum of its proper divisors (78114822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56107002 is a wasteful number, since it uses less digits than its factorization.
56107002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 763.
The product of its (nonzero) digits is 420, while the sum is 21.
The square root of 56107002 is about 7490.4607334930. The cubic root of 56107002 is about 382.8297570685.
56107002 divided by its sum of digits (21) gives a palindrome (2671762).
Adding to 56107002 its reverse (20070165), we get a palindrome (76177167).
The spelling of 56107002 in words is "fifty-six million, one hundred seven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •