Base | Representation |
---|---|
bin | 100100010000101010011… |
… | …000000100000011001001 |
3 | 22211012202021020002100022 |
4 | 210100222120010003021 |
5 | 311311142221422133 |
6 | 5144414033550225 |
7 | 345011633246201 |
oct | 44205230040311 |
9 | 8735667202308 |
10 | 2491791982793 |
11 | 880843682493 |
12 | 342b14115375 |
13 | 150c8a038819 |
14 | 8886393b401 |
15 | 44c3d225998 |
hex | 2442a6040c9 |
2491791982793 has 8 divisors (see below), whose sum is σ = 2501878545312. Its totient is φ = 2481708450816.
The previous prime is 2491791982783. The next prime is 2491791982807. The reversal of 2491791982793 is 3972891971942.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2491791982793 - 234 = 2474612113609 is a prime.
It is a super-2 number, since 2×24917919827932 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2491791982783) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 897446 + ... + 2406032.
It is an arithmetic number, because the mean of its divisors is an integer number (312734818164).
Almost surely, 22491791982793 is an apocalyptic number.
It is an amenable number.
2491791982793 is a deficient number, since it is larger than the sum of its proper divisors (10086562519).
2491791982793 is a wasteful number, since it uses less digits than its factorization.
2491791982793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1515271.
The product of its digits is 123451776, while the sum is 71.
The spelling of 2491791982793 in words is "two trillion, four hundred ninety-one billion, seven hundred ninety-one million, nine hundred eighty-two thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •