Base | Representation |
---|---|
bin | 11000001001110111… |
… | …00111001011001010 |
3 | 1020110201220020202000 |
4 | 30010323213023022 |
5 | 203024203401311 |
6 | 5542433251430 |
7 | 636231046632 |
oct | 140473471312 |
9 | 36421806660 |
10 | 12967637706 |
11 | 5554991161 |
12 | 261aa03b76 |
13 | 12b878070a |
14 | 8b03436c2 |
15 | 50d6ad056 |
hex | 304ee72ca |
12967637706 has 32 divisors (see below), whose sum is σ = 30512090880. Its totient is φ = 4068278208.
The previous prime is 12967637701. The next prime is 12967637707. The reversal of 12967637706 is 60773676921.
12967637706 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (54) 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 (54).
It is not an unprimeable number, because it can be changed into a prime (12967637701) 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 15 ways as a sum of consecutive naturals, for example, 7062066 + ... + 7063901.
It is an arithmetic number, because the mean of its divisors is an integer number (953502840).
Almost surely, 212967637706 is an apocalyptic number.
12967637706 is an abundant number, since it is smaller than the sum of its proper divisors (17544453174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12967637706 is a wasteful number, since it uses less digits than its factorization.
12967637706 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14125995 (or 14125989 counting only the distinct ones).
The product of its (nonzero) digits is 4000752, while the sum is 54.
The spelling of 12967637706 in words is "twelve billion, nine hundred sixty-seven million, six hundred thirty-seven thousand, seven hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •