Base | Representation |
---|---|
bin | 10110101100111101… |
… | …01000010000110011 |
3 | 1011110102102011222222 |
4 | 23112132220100303 |
5 | 144430200204201 |
6 | 5333233151255 |
7 | 611015511332 |
oct | 132636502063 |
9 | 34412364888 |
10 | 12188288051 |
11 | 5194a75235 |
12 | 24419bb52b |
13 | 11c317ac84 |
14 | 838a31d19 |
15 | 4b506491b |
hex | 2d67a8433 |
12188288051 has 2 divisors, whose sum is σ = 12188288052. Its totient is φ = 12188288050.
The previous prime is 12188288029. The next prime is 12188288053. The reversal of 12188288051 is 15088288121.
12188288051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12188288051 - 26 = 12188287987 is a prime.
It is a super-2 number, since 2×121882880512 (a number of 21 digits) contains 22 as substring.
Together with 12188288053, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 12188287993 and 12188288011.
It is not a weakly prime, because it can be changed into another prime (12188288053) 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 as a sum of consecutive naturals, namely, 6094144025 + 6094144026.
It is an arithmetic number, because the mean of its divisors is an integer number (6094144026).
Almost surely, 212188288051 is an apocalyptic number.
12188288051 is a deficient number, since it is larger than the sum of its proper divisors (1).
12188288051 is an equidigital number, since it uses as much as digits as its factorization.
12188288051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81920, while the sum is 44.
The spelling of 12188288051 in words is "twelve billion, one hundred eighty-eight million, two hundred eighty-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •