Base | Representation |
---|---|
bin | 11000001100011010… |
… | …00101111010101011 |
3 | 1020112020002102120202 |
4 | 30012031011322223 |
5 | 203100140403131 |
6 | 5544515142415 |
7 | 636610440524 |
oct | 140615057253 |
9 | 36466072522 |
10 | 12988997291 |
11 | 5565a4aa06 |
12 | 2625ba4a0b |
13 | 12c001b91a |
14 | 8b310384b |
15 | 5104cbbcb |
hex | 306345eab |
12988997291 has 4 divisors (see below), whose sum is σ = 13043344800. Its totient is φ = 12934649784.
The previous prime is 12988997261. The next prime is 12988997321. The reversal of 12988997291 is 19279988921.
12988997291 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.
It is an interprime number because it is at equal distance from previous prime (12988997261) and next prime (12988997321).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12988997291 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12988997201) 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, 27173396 + ... + 27173873.
It is an arithmetic number, because the mean of its divisors is an integer number (3260836200).
Almost surely, 212988997291 is an apocalyptic number.
12988997291 is a deficient number, since it is larger than the sum of its proper divisors (54347509).
12988997291 is an equidigital number, since it uses as much as digits as its factorization.
12988997291 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54347508.
The product of its digits is 11757312, while the sum is 65.
The spelling of 12988997291 in words is "twelve billion, nine hundred eighty-eight million, nine hundred ninety-seven thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •