Base | Representation |
---|---|
bin | 10111101000111100… |
… | …00111100100010101 |
3 | 1012202111020111201011 |
4 | 23310132013210111 |
5 | 201443004024423 |
6 | 5455210132221 |
7 | 626335502023 |
oct | 136436074425 |
9 | 35674214634 |
10 | 12691470613 |
11 | 5423005798 |
12 | 2562421071 |
13 | 12734a8833 |
14 | 8857b5713 |
15 | 4e430ab0d |
hex | 2f4787915 |
12691470613 has 4 divisors (see below), whose sum is σ = 12695765580. Its totient is φ = 12687175648.
The previous prime is 12691470611. The next prime is 12691470653. The reversal of 12691470613 is 31607419621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31607419621 = 7649 ⋅4132229.
It can be written as a sum of positive squares in 2 ways, for example, as 5226856209 + 7464614404 = 72297^2 + 86398^2 .
It is a cyclic number.
It is not a de Polignac number, because 12691470613 - 21 = 12691470611 is a prime.
It is a super-2 number, since 2×126914706132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12691470611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2143048 + ... + 2148961.
It is an arithmetic number, because the mean of its divisors is an integer number (3173941395).
Almost surely, 212691470613 is an apocalyptic number.
It is an amenable number.
12691470613 is a deficient number, since it is larger than the sum of its proper divisors (4294967).
12691470613 is an equidigital number, since it uses as much as digits as its factorization.
12691470613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4294966.
The product of its (nonzero) digits is 54432, while the sum is 40.
The spelling of 12691470613 in words is "twelve billion, six hundred ninety-one million, four hundred seventy thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •