Base | Representation |
---|---|
bin | 1011101111011010101011… |
… | …0010110000001001011001 |
3 | 1200201010000021121100002101 |
4 | 2323312222302300021121 |
5 | 3143001111442434414 |
6 | 43242231325003401 |
7 | 2501443024555102 |
oct | 273665262601131 |
9 | 50633007540071 |
10 | 12909242155609 |
11 | 4127862720a28 |
12 | 1545a930b3561 |
13 | 72844ab53007 |
14 | 328b4c6133a9 |
15 | 175beba0da74 |
hex | bbdaacb0259 |
12909242155609 has 2 divisors, whose sum is σ = 12909242155610. Its totient is φ = 12909242155608.
The previous prime is 12909242155573. The next prime is 12909242155631. The reversal of 12909242155609 is 90655124290921.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11839600120384 + 1069642035225 = 3440872^2 + 1034235^2 .
It is a cyclic number.
It is not a de Polignac number, because 12909242155609 - 221 = 12909240058457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12909242155609.
It is not a weakly prime, because it can be changed into another prime (12909242158609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6454621077804 + 6454621077805.
It is an arithmetic number, because the mean of its divisors is an integer number (6454621077805).
Almost surely, 212909242155609 is an apocalyptic number.
It is an amenable number.
12909242155609 is a deficient number, since it is larger than the sum of its proper divisors (1).
12909242155609 is an equidigital number, since it uses as much as digits as its factorization.
12909242155609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3499200, while the sum is 55.
The spelling of 12909242155609 in words is "twelve trillion, nine hundred nine billion, two hundred forty-two million, one hundred fifty-five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •