Base | Representation |
---|---|
bin | 111011111111001… |
… | …000110100000000 |
3 | 2121010201202202002 |
4 | 323333020310000 |
5 | 4030120010122 |
6 | 243510443132 |
7 | 33640213640 |
oct | 7377106400 |
9 | 2533652662 |
10 | 1006406912 |
11 | 4770aa455 |
12 | 2410634a8 |
13 | 130671464 |
14 | 97938520 |
15 | 5d549992 |
hex | 3bfc8d00 |
1006406912 has 72 divisors (see below), whose sum is σ = 2325254400. Its totient is φ = 425797632.
The previous prime is 1006406897. The next prime is 1006406917. The reversal of 1006406912 is 2196046001.
1006406912 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1006406917) 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, 138014 + ... + 145122.
It is an arithmetic number, because the mean of its divisors is an integer number (32295200).
Almost surely, 21006406912 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 1006406912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1162627200).
1006406912 is an abundant number, since it is smaller than the sum of its proper divisors (1318847488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1006406912 is an frugal number, since it uses more digits than its factorization.
1006406912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7211 (or 7197 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 1006406912 is about 31723.9170343134. The cubic root of 1006406912 is about 1002.1310925517.
The spelling of 1006406912 in words is "one billion, six million, four hundred six thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •