Base | Representation |
---|---|
bin | 10111011110110101… |
… | …01010110000010000 |
3 | 1012112120200200222001 |
4 | 23233122222300100 |
5 | 201304302230310 |
6 | 5442540523344 |
7 | 624256004221 |
oct | 135732526020 |
9 | 35476620861 |
10 | 12606680080 |
11 | 538a162375 |
12 | 2539b50554 |
13 | 125ba5bb17 |
14 | 878423248 |
15 | 4dbb5c93a |
hex | 2ef6aac10 |
12606680080 has 40 divisors (see below), whose sum is σ = 29584481472. Its totient is φ = 4995540864.
The previous prime is 12606680077. The next prime is 12606680081. The reversal of 12606680080 is 8008660621.
12606680080 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is not an unprimeable number, because it can be changed into a prime (12606680081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 727812 + ... + 744931.
Almost surely, 212606680080 is an apocalyptic number.
12606680080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12606680080 is an abundant number, since it is smaller than the sum of its proper divisors (16977801392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12606680080 is a wasteful number, since it uses less digits than its factorization.
12606680080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472863 (or 1472857 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 37.
It can be divided in two parts, 1260 and 6680080, that added together give a triangular number (6681340 = T3655).
The spelling of 12606680080 in words is "twelve billion, six hundred six million, six hundred eighty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •