Base | Representation |
---|---|
bin | 100110110101101111101… |
… | …010100101000111010100 |
3 | 100110011021112221000202001 |
4 | 212311233222211013110 |
5 | 322212202304430420 |
6 | 5402051020125044 |
7 | 363555333503446 |
oct | 46655752450724 |
9 | 10404245830661 |
10 | 2669048123860 |
11 | 939a340a1858 |
12 | 371342996784 |
13 | 1648c837b4b1 |
14 | 9327b168496 |
15 | 49664ad3b0a |
hex | 26d6faa51d4 |
2669048123860 has 24 divisors (see below), whose sum is σ = 5756487576840. Its totient is φ = 1038764674944.
The previous prime is 2669048123851. The next prime is 2669048123879. The reversal of 2669048123860 is 683218409662.
It can be written as a sum of positive squares in 4 ways, for example, as 365804813124 + 2303243310736 = 604818^2 + 1517644^2 .
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 7 ways as a sum of consecutive naturals, for example, 1803410155 + ... + 1803411634.
It is an arithmetic number, because the mean of its divisors is an integer number (239853649035).
Almost surely, 22669048123860 is an apocalyptic number.
2669048123860 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2669048123860 is an abundant number, since it is smaller than the sum of its proper divisors (3087439452980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2669048123860 is a wasteful number, since it uses less digits than its factorization.
2669048123860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3606821835 (or 3606821833 counting only the distinct ones).
The product of its (nonzero) digits is 5971968, while the sum is 55.
The spelling of 2669048123860 in words is "two trillion, six hundred sixty-nine billion, forty-eight million, one hundred twenty-three thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •