Base | Representation |
---|---|
bin | 100110101010001101101… |
… | …001111000101011110000 |
3 | 100101222022122110001222102 |
4 | 212222031221320223300 |
5 | 322011323041401324 |
6 | 5352242231555532 |
7 | 362636445303311 |
oct | 46521551705360 |
9 | 10358278401872 |
10 | 2656666356464 |
11 | 93475a99873a |
12 | 36aa6822bba8 |
13 | 1636a40ba203 |
14 | 92824970608 |
15 | 4918caa1dae |
hex | 26a8da78af0 |
2656666356464 has 20 divisors (see below), whose sum is σ = 5147317749240. Its totient is φ = 1328326292160.
The previous prime is 2656666356439. The next prime is 2656666356467. The reversal of 2656666356464 is 4646536666562.
2656666356464 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×26566663564642 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2656666356464.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2656666356467) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4385459 + ... + 4954349.
It is an arithmetic number, because the mean of its divisors is an integer number (257365887462).
Almost surely, 22656666356464 is an apocalyptic number.
It is an amenable number.
2656666356464 is a deficient number, since it is larger than the sum of its proper divisors (2490651392776).
2656666356464 is a wasteful number, since it uses less digits than its factorization.
2656666356464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 860768 (or 860762 counting only the distinct ones).
The product of its digits is 671846400, while the sum is 65.
The spelling of 2656666356464 in words is "two trillion, six hundred fifty-six billion, six hundred sixty-six million, three hundred fifty-six thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •