Base | Representation |
---|---|
bin | 100111000001000110110… |
… | …010101110100111100011 |
3 | 100111022202201211011212100 |
4 | 213001012302232213203 |
5 | 322412143301432341 |
6 | 5411425322501443 |
7 | 364466543656056 |
oct | 47010662564743 |
9 | 10438681734770 |
10 | 2681247295971 |
11 | 944124220382 |
12 | 373788364883 |
13 | 165ac086a52a |
14 | 93ab73d0a9d |
15 | 49b2aa983b6 |
hex | 27046cae9e3 |
2681247295971 has 24 divisors (see below), whose sum is σ = 3880107962640. Its totient is φ = 1784177971200.
The previous prime is 2681247295963. The next prime is 2681247295981. The reversal of 2681247295971 is 1795927421862.
2681247295971 is a `hidden beast` number, since 2 + 6 + 8 + 1 + 2 + 472 + 95 + 9 + 71 = 666.
2681247295971 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2681247295971 - 23 = 2681247295963 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2681247295899 and 2681247295908.
It is not an unprimeable number, because it can be changed into a prime (2681247295981) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 68658211 + ... + 68697251.
It is an arithmetic number, because the mean of its divisors is an integer number (161671165110).
Almost surely, 22681247295971 is an apocalyptic number.
2681247295971 is a deficient number, since it is larger than the sum of its proper divisors (1198860666669).
2681247295971 is a wasteful number, since it uses less digits than its factorization.
2681247295971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53027 (or 53024 counting only the distinct ones).
The product of its digits is 30481920, while the sum is 63.
The spelling of 2681247295971 in words is "two trillion, six hundred eighty-one billion, two hundred forty-seven million, two hundred ninety-five thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •