Base | Representation |
---|---|
bin | 101000111011111001000… |
… | …010001110010000010000 |
3 | 100221221001211221220022120 |
4 | 220323321002032100100 |
5 | 332042200200033130 |
6 | 5552151511134240 |
7 | 410144624412531 |
oct | 50737102162020 |
9 | 10857054856276 |
10 | 2813086721040 |
11 | 995029131812 |
12 | 395241074380 |
13 | 17537185705b |
14 | 9a222cb6688 |
15 | 4d295151910 |
hex | 28ef908e410 |
2813086721040 has 40 divisors (see below), whose sum is σ = 8720568835968. Its totient is φ = 750156458880.
The previous prime is 2813086721023. The next prime is 2813086721059. The reversal of 2813086721040 is 401276803182.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-4 number, since 4×28130867210404 (a number of 51 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2813086720983 and 2813086721001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5860597096 + ... + 5860597575.
Almost surely, 22813086721040 is an apocalyptic number.
2813086721040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2813086721040 is an abundant number, since it is smaller than the sum of its proper divisors (5907482114928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2813086721040 is a wasteful number, since it uses less digits than its factorization.
2813086721040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11721194687 (or 11721194681 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 42.
The spelling of 2813086721040 in words is "two trillion, eight hundred thirteen billion, eighty-six million, seven hundred twenty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •