Base | Representation |
---|---|
bin | 110000101000… |
… | …111011101010 |
3 | 212222210111100 |
4 | 300220323222 |
5 | 11231004240 |
6 | 1133142230 |
7 | 213243450 |
oct | 60507352 |
9 | 25883440 |
10 | 12750570 |
11 | 7219768 |
12 | 432a976 |
13 | 2845821 |
14 | 199c9d0 |
15 | 11bce30 |
hex | c28eea |
12750570 has 96 divisors (see below), whose sum is σ = 38982528. Its totient is φ = 2830464.
The previous prime is 12750559. The next prime is 12750571. The reversal of 12750570 is 7505721.
12750570 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (12750571) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 23037 + ... + 23583.
It is an arithmetic number, because the mean of its divisors is an integer number (406068).
Almost surely, 212750570 is an apocalyptic number.
12750570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12750570, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19491264).
12750570 is an abundant number, since it is smaller than the sum of its proper divisors (26231958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12750570 is a wasteful number, since it uses less digits than its factorization.
12750570 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 604 (or 601 counting only the distinct ones).
The product of its (nonzero) digits is 2450, while the sum is 27.
The square root of 12750570 is about 3570.7940293442. The cubic root of 12750570 is about 233.6199177089.
The spelling of 12750570 in words is "twelve million, seven hundred fifty thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •