Base | Representation |
---|---|
bin | 10111101110011100… |
… | …00111100000000101 |
3 | 1012212201001111212121 |
4 | 23313032013200011 |
5 | 202041311421220 |
6 | 5503535045541 |
7 | 630435610315 |
oct | 136716074005 |
9 | 35781044777 |
10 | 12737607685 |
11 | 5447058200 |
12 | 25759708b1 |
13 | 127cc1088a |
14 | 88b985445 |
15 | 4e83c0eaa |
hex | 2f7387805 |
12737607685 has 12 divisors (see below), whose sum is σ = 16801010604. Its totient is φ = 9263714240.
The previous prime is 12737607683. The next prime is 12737607709. The reversal of 12737607685 is 58670673721.
12737607685 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 6222212161 + 6515395524 = 78881^2 + 80718^2 .
It is not a de Polignac number, because 12737607685 - 21 = 12737607683 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12737607683) 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 11 ways as a sum of consecutive naturals, for example, 10526344 + ... + 10527553.
It is an arithmetic number, because the mean of its divisors is an integer number (1400084217).
Almost surely, 212737607685 is an apocalyptic number.
It is an amenable number.
12737607685 is a deficient number, since it is larger than the sum of its proper divisors (4063402919).
12737607685 is a wasteful number, since it uses less digits than its factorization.
12737607685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21053924 (or 21053913 counting only the distinct ones).
The product of its (nonzero) digits is 2963520, while the sum is 52.
The spelling of 12737607685 in words is "twelve billion, seven hundred thirty-seven million, six hundred seven thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •