Base | Representation |
---|---|
bin | 101011101000111000110… |
… | …011111110000000000000 |
3 | 101121200112100010102120000 |
4 | 223220320303332000000 |
5 | 343113111110220000 |
6 | 10213352003320000 |
7 | 426442026065610 |
oct | 53507063760000 |
9 | 11550470112500 |
10 | 2998840320000 |
11 | a5688a1a9a58 |
12 | 405241680000 |
13 | 189a354b4b15 |
14 | a5204ca0a40 |
15 | 53017a20000 |
hex | 2ba38cfe000 |
2998840320000 has 1400 divisors, whose sum is σ = 12806792152176. Its totient is φ = 684785664000.
The previous prime is 2998840319999. The next prime is 2998840320031. The reversal of 2998840320000 is 230488992.
It is a tau number, because it is divible by the number of its divisors (1400).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 2903039484 + ... + 2903040516.
Almost surely, 22998840320000 is an apocalyptic number.
2998840320000 is a gapful number since it is divisible by the number (20) 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 2998840320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6403396076088).
2998840320000 is an abundant number, since it is smaller than the sum of its proper divisors (9807951832176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2998840320000 is an frugal number, since it uses more digits than its factorization.
2998840320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1098 (or 1050 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 45.
The spelling of 2998840320000 in words is "two trillion, nine hundred ninety-eight billion, eight hundred forty million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •