Base | Representation |
---|---|
bin | 101001001111001011011… |
… | …010010101110100111100 |
3 | 101000220112010100210001101 |
4 | 221033023122111310330 |
5 | 332412103302044220 |
6 | 10005454501422444 |
7 | 411510052440502 |
oct | 51171332256474 |
9 | 11026463323041 |
10 | 2833796128060 |
11 | 9a2896045827 |
12 | 39926070aa24 |
13 | 1772c21b5a51 |
14 | 9b2294a4672 |
15 | 4daa82ec30a |
hex | 293cb695d3c |
2833796128060 has 12 divisors (see below), whose sum is σ = 5950971868968. Its totient is φ = 1133518451216.
The previous prime is 2833796128003. The next prime is 2833796128087. The reversal of 2833796128060 is 608216973382.
It is a junction number, because it is equal to n+sod(n) for n = 2833796127992 and 2833796128010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 70844903182 + ... + 70844903221.
It is an arithmetic number, because the mean of its divisors is an integer number (495914322414).
Almost surely, 22833796128060 is an apocalyptic number.
2833796128060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2833796128060 is an abundant number, since it is smaller than the sum of its proper divisors (3117175740908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2833796128060 is a wasteful number, since it uses less digits than its factorization.
2833796128060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141689806412 (or 141689806410 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 55.
The spelling of 2833796128060 in words is "two trillion, eight hundred thirty-three billion, seven hundred ninety-six million, one hundred twenty-eight thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •