Base | Representation |
---|---|
bin | 100110110111010111010… |
… | …010001110010111000000 |
3 | 100110022202201010020001200 |
4 | 212313113102032113000 |
5 | 322224232330212124 |
6 | 5402535321101200 |
7 | 363646403161533 |
oct | 46672722162700 |
9 | 10408681106050 |
10 | 2670786569664 |
11 | 93a746433924 |
12 | 371749027800 |
13 | 164b14599055 |
14 | 933a3dbaa1a |
15 | 4971752dbc9 |
hex | 26dd748e5c0 |
2670786569664 has 42 divisors (see below), whose sum is σ = 7655327478240. Its totient is φ = 890262189696.
The previous prime is 2670786569657. The next prime is 2670786569681. The reversal of 2670786569664 is 4669656870762.
2670786569664 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 2670786569592 and 2670786569601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2318390544 + ... + 2318391695.
Almost surely, 22670786569664 is an apocalyptic number.
2670786569664 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2670786569664 is an abundant number, since it is smaller than the sum of its proper divisors (4984540908576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2670786569664 is a wasteful number, since it uses less digits than its factorization.
2670786569664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4636782257 (or 4636782244 counting only the distinct ones).
The product of its (nonzero) digits is 1097349120, while the sum is 72.
The spelling of 2670786569664 in words is "two trillion, six hundred seventy billion, seven hundred eighty-six million, five hundred sixty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •