Base | Representation |
---|---|
bin | 101011001101000100110… |
… | …110110000000000000000 |
3 | 101111211110011011022021000 |
4 | 223031010312300000000 |
5 | 342120431231321413 |
6 | 10151532433532000 |
7 | 424334014150461 |
oct | 53150466600000 |
9 | 11454404138230 |
10 | 2968977604608 |
11 | a45155502984 |
12 | 3bb4a8714000 |
13 | 186c866b9122 |
14 | a39b0b90d68 |
15 | 5236aeb3073 |
hex | 2b344db0000 |
2968977604608 has 272 divisors, whose sum is σ = 8856729612000. Its totient is φ = 982929899520.
The previous prime is 2968977604603. The next prime is 2968977604609. The reversal of 2968977604608 is 8064067798692.
2968977604608 is a `hidden beast` number, since 2 + 9 + 6 + 8 + 9 + 7 + 7 + 6 + 0 + 4 + 608 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is not an unprimeable number, because it can be changed into a prime (2968977604603) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 263645698 + ... + 263656958.
Almost surely, 22968977604608 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 2968977604608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4428364806000).
2968977604608 is an abundant number, since it is smaller than the sum of its proper divisors (5887752007392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2968977604608 is an equidigital number, since it uses as much as digits as its factorization.
2968977604608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11451 (or 11415 counting only the distinct ones).
The product of its (nonzero) digits is 438939648, while the sum is 72.
The spelling of 2968977604608 in words is "two trillion, nine hundred sixty-eight billion, nine hundred seventy-seven million, six hundred four thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •