Base | Representation |
---|---|
bin | 1011111011000111000001… |
… | …0010001001011110001001 |
3 | 1201102022112002020000000202 |
4 | 2332301300102021132021 |
5 | 3204244013220233334 |
6 | 43514412515541545 |
7 | 2522114044163363 |
oct | 276616022113611 |
9 | 51368462200022 |
10 | 13110123992969 |
11 | 41a4a77239633 |
12 | 15789b5bba8b5 |
13 | 741382a79833 |
14 | 334767883d33 |
15 | 17b0575c317e |
hex | bec70489789 |
13110123992969 has 2 divisors, whose sum is σ = 13110123992970. Its totient is φ = 13110123992968.
The previous prime is 13110123992963. The next prime is 13110123992983. The reversal of 13110123992969 is 96929932101131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12885838399225 + 224285593744 = 3589685^2 + 473588^2 .
It is a cyclic number.
It is not a de Polignac number, because 13110123992969 - 236 = 13041404516233 is a prime.
It is a super-2 number, since 2×131101239929692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13110123992963) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555061996484 + 6555061996485.
It is an arithmetic number, because the mean of its divisors is an integer number (6555061996485).
Almost surely, 213110123992969 is an apocalyptic number.
It is an amenable number.
13110123992969 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110123992969 is an equidigital number, since it uses as much as digits as its factorization.
13110123992969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1417176, while the sum is 56.
The spelling of 13110123992969 in words is "thirteen trillion, one hundred ten billion, one hundred twenty-three million, nine hundred ninety-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •