Base | Representation |
---|---|
bin | 101000101110111001001… |
… | …000101101101100100110 |
3 | 100220121001011111210010122 |
4 | 220232321020231230212 |
5 | 331330104210411412 |
6 | 5541522533321542 |
7 | 406142021356415 |
oct | 50567110555446 |
9 | 10817034453118 |
10 | 2799129778982 |
11 | 98a116872659 |
12 | 3925a6a962b2 |
13 | 173c59142864 |
14 | 9969b40b47c |
15 | 4cc29bc6572 |
hex | 28bb922db26 |
2799129778982 has 8 divisors (see below), whose sum is σ = 4198771338552. Its totient is φ = 1399539332800.
The previous prime is 2799129778981. The next prime is 2799129779009. The reversal of 2799129778982 is 2898779219972.
2799129778982 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×27991297789823 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2799129778897 and 2799129778906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2799129778981) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12641144 + ... + 12860667.
It is an arithmetic number, because the mean of its divisors is an integer number (524846417319).
Almost surely, 22799129778982 is an apocalyptic number.
2799129778982 is a deficient number, since it is larger than the sum of its proper divisors (1399641559570).
2799129778982 is a wasteful number, since it uses less digits than its factorization.
2799129778982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25556694.
The product of its digits is 1152216576, while the sum is 80.
The spelling of 2799129778982 in words is "two trillion, seven hundred ninety-nine billion, one hundred twenty-nine million, seven hundred seventy-eight thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •