Base | Representation |
---|---|
bin | 1100101101100101… |
… | …0011010100010010 |
3 | 22210211001021011120 |
4 | 3023121103110102 |
5 | 23442034020240 |
6 | 1322335423110 |
7 | 150363662055 |
oct | 31331232422 |
9 | 8724037146 |
10 | 3412407570 |
11 | 14a1240350 |
12 | 7b2984a96 |
13 | 424c7b4a0 |
14 | 2452baa9c |
15 | 14e8a8ad0 |
hex | cb653512 |
3412407570 has 128 divisors (see below), whose sum is σ = 9660591360. Its totient is φ = 760519680.
The previous prime is 3412407563. The next prime is 3412407571. The reversal of 3412407570 is 757042143.
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 (3412407571) 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, 1152532 + ... + 1155488.
It is an arithmetic number, because the mean of its divisors is an integer number (75473370).
Almost surely, 23412407570 is an apocalyptic number.
3412407570 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3412407570, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4830295680).
3412407570 is an abundant number, since it is smaller than the sum of its proper divisors (6248183790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3412407570 is a wasteful number, since it uses less digits than its factorization.
3412407570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3260.
The product of its (nonzero) digits is 23520, while the sum is 33.
The square root of 3412407570 is about 58415.8160946160. The cubic root of 3412407570 is about 1505.5215125498.
The spelling of 3412407570 in words is "three billion, four hundred twelve million, four hundred seven thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •