Base | Representation |
---|---|
bin | 10110111001010011… |
… | …00001110110010001 |
3 | 1011201122012120120111 |
4 | 23130221201312101 |
5 | 200133200334112 |
6 | 5351412041321 |
7 | 613413435562 |
oct | 133451416621 |
9 | 34648176514 |
10 | 12291808657 |
11 | 5238450857 |
12 | 2470603241 |
13 | 120b75507b |
14 | 84869c169 |
15 | 4be1b25a7 |
hex | 2dca61d91 |
12291808657 has 2 divisors, whose sum is σ = 12291808658. Its totient is φ = 12291808656.
The previous prime is 12291808631. The next prime is 12291808663. The reversal of 12291808657 is 75680819221.
It is a happy number.
12291808657 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 can be written as a sum of positive squares in only one way, i.e., 9734584896 + 2557223761 = 98664^2 + 50569^2 .
It is a cyclic number.
It is not a de Polignac number, because 12291808657 - 211 = 12291806609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12291808657.
It is not a weakly prime, because it can be changed into another prime (12291800657) 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, 6145904328 + 6145904329.
It is an arithmetic number, because the mean of its divisors is an integer number (6145904329).
Almost surely, 212291808657 is an apocalyptic number.
It is an amenable number.
12291808657 is a deficient number, since it is larger than the sum of its proper divisors (1).
12291808657 is an equidigital number, since it uses as much as digits as its factorization.
12291808657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 483840, while the sum is 49.
The spelling of 12291808657 in words is "twelve billion, two hundred ninety-one million, eight hundred eight thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •