Base | Representation |
---|---|
bin | 11000001101011110… |
… | …01010100001110101 |
3 | 1020112211220012200122 |
4 | 30012233022201311 |
5 | 203104432212302 |
6 | 5545434421325 |
7 | 640046400650 |
oct | 140657124165 |
9 | 36484805618 |
10 | 12997929077 |
11 | 556aaa0551 |
12 | 2628b91845 |
13 | 12c1b281c3 |
14 | 8b438a897 |
15 | 5111933a2 |
hex | 306bca875 |
12997929077 has 4 divisors (see below), whose sum is σ = 14854776096. Its totient is φ = 11141082060.
The previous prime is 12997929053. The next prime is 12997929107. The reversal of 12997929077 is 77092979921.
12997929077 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12997929077 - 218 = 12997666933 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 (12997929277) 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 3 ways as a sum of consecutive naturals, for example, 928423499 + ... + 928423512.
It is an arithmetic number, because the mean of its divisors is an integer number (3713694024).
Almost surely, 212997929077 is an apocalyptic number.
It is an amenable number.
12997929077 is a deficient number, since it is larger than the sum of its proper divisors (1856847019).
12997929077 is an equidigital number, since it uses as much as digits as its factorization.
12997929077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1856847018.
The product of its (nonzero) digits is 9001692, while the sum is 62.
The spelling of 12997929077 in words is "twelve billion, nine hundred ninety-seven million, nine hundred twenty-nine thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •