Base | Representation |
---|---|
bin | 1011100111000111010010… |
… | …0000010111010100111000 |
3 | 1200012110211010102020022110 |
4 | 2321301310200113110320 |
5 | 3133131442421214140 |
6 | 43052521025452320 |
7 | 2455233120540024 |
oct | 271616440272470 |
9 | 50173733366273 |
10 | 12766597444920 |
11 | 4082313484580 |
12 | 15223037a10a0 |
13 | 717b67395367 |
14 | 321c99a65384 |
15 | 17214da29380 |
hex | b9c74817538 |
12766597444920 has 64 divisors (see below), whose sum is σ = 41781591642240. Its totient is φ = 3094932713600.
The previous prime is 12766597444889. The next prime is 12766597444933. The reversal of 12766597444920 is 2944479566721.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4835831046 + ... + 4835833685.
It is an arithmetic number, because the mean of its divisors is an integer number (652837369410).
Almost surely, 212766597444920 is an apocalyptic number.
12766597444920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12766597444920 is an abundant number, since it is smaller than the sum of its proper divisors (29014994197320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12766597444920 is a wasteful number, since it uses less digits than its factorization.
12766597444920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9671664756 (or 9671664752 counting only the distinct ones).
The product of its (nonzero) digits is 182891520, while the sum is 66.
The spelling of 12766597444920 in words is "twelve trillion, seven hundred sixty-six billion, five hundred ninety-seven million, four hundred forty-four thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •