Base | Representation |
---|---|
bin | 100011110010000… |
… | …1010111101110000 |
3 | 10002200021001222001 |
4 | 1013210022331300 |
5 | 4424332230212 |
6 | 315050223344 |
7 | 41516323252 |
oct | 10744127560 |
9 | 3080231861 |
10 | 1200664432 |
11 | 56681aa60 |
12 | 296124b54 |
13 | 161997a36 |
14 | b5663cd2 |
15 | 7061c657 |
hex | 4790af70 |
1200664432 has 40 divisors (see below), whose sum is σ = 2547515520. Its totient is φ = 543660480.
The previous prime is 1200664429. The next prime is 1200664433. The reversal of 1200664432 is 2344660021.
It is a self number, because there is not a number n which added to its sum of digits gives 1200664432.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200664433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33319 + ... + 59257.
It is an arithmetic number, because the mean of its divisors is an integer number (63687888).
Almost surely, 21200664432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1200664432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1273757760).
1200664432 is an abundant number, since it is smaller than the sum of its proper divisors (1346851088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200664432 is a wasteful number, since it uses less digits than its factorization.
1200664432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26221 (or 26215 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
The square root of 1200664432 is about 34650.6050740820. The cubic root of 1200664432 is about 1062.8546619838.
The spelling of 1200664432 in words is "one billion, two hundred million, six hundred sixty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •