Base | Representation |
---|---|
bin | 10111101001100011… |
… | …10101100000110001 |
3 | 1012202211222010010210 |
4 | 23310301311200301 |
5 | 202000314431122 |
6 | 5455513014333 |
7 | 626430440541 |
oct | 136461654061 |
9 | 35684863123 |
10 | 12696639537 |
11 | 5425a1622a |
12 | 25640b43a9 |
13 | 127459847a |
14 | 88635d321 |
15 | 4e49cc40c |
hex | 2f4c75831 |
12696639537 has 16 divisors (see below), whose sum is σ = 17286056640. Its totient is φ = 8287517952.
The previous prime is 12696639511. The next prime is 12696639547. The reversal of 12696639537 is 73593669621.
It is a happy number.
12696639537 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12696639537 - 211 = 12696637489 is a prime.
It is a super-2 number, since 2×126966395372 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12696639547) 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, 181587 + ... + 241592.
It is an arithmetic number, because the mean of its divisors is an integer number (1080378540).
Almost surely, 212696639537 is an apocalyptic number.
It is an amenable number.
12696639537 is a deficient number, since it is larger than the sum of its proper divisors (4589417103).
12696639537 is a wasteful number, since it uses less digits than its factorization.
12696639537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423392.
The product of its digits is 11022480, while the sum is 57.
It can be divided in two parts, 1269663 and 9537, that added together give a triangular number (1279200 = T1599).
The spelling of 12696639537 in words is "twelve billion, six hundred ninety-six million, six hundred thirty-nine thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •