Base | Representation |
---|---|
bin | 1011001101011100… |
… | …0001011001011000 |
3 | 21202201020222222000 |
4 | 2303113001121120 |
5 | 22130321003241 |
6 | 1214332401000 |
7 | 134366260410 |
oct | 26327013130 |
9 | 7681228860 |
10 | 3009156696 |
11 | 1304654a67 |
12 | 6bb916160 |
13 | 38c56c2c0 |
14 | 20790b640 |
15 | 1292a1eb6 |
hex | b35c1658 |
3009156696 has 256 divisors, whose sum is σ = 10644480000. Its totient is φ = 766112256.
The previous prime is 3009156659. The next prime is 3009156697. The reversal of 3009156696 is 6966519003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3009156697) 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, 567385 + ... + 572663.
It is an arithmetic number, because the mean of its divisors is an integer number (41580000).
Almost surely, 23009156696 is an apocalyptic number.
3009156696 is a gapful number since it is divisible by the number (36) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3009156696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5322240000).
3009156696 is an abundant number, since it is smaller than the sum of its proper divisors (7635323304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3009156696 is a wasteful number, since it uses less digits than its factorization.
3009156696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5343 (or 5333 counting only the distinct ones).
The product of its (nonzero) digits is 262440, while the sum is 45.
The square root of 3009156696 is about 54855.7808804141. The cubic root of 3009156696 is about 1443.7154400228.
The spelling of 3009156696 in words is "three billion, nine million, one hundred fifty-six thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •