Base | Representation |
---|---|
bin | 1011111110001110100010… |
… | …0010001000100011001001 |
3 | 1201121102202120021202010201 |
4 | 2333203220202020203021 |
5 | 3211133204322310334 |
6 | 43555151145412201 |
7 | 2526021200544202 |
oct | 277435042104311 |
9 | 51542676252121 |
10 | 13163681056969 |
11 | 421575a8644a3 |
12 | 158726219a061 |
13 | 746439745651 |
14 | 3371a87885a9 |
15 | 17c63e397c14 |
hex | bf8e88888c9 |
13163681056969 has 2 divisors, whose sum is σ = 13163681056970. Its totient is φ = 13163681056968.
The previous prime is 13163681056879. The next prime is 13163681056973. The reversal of 13163681056969 is 96965018636131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10549276641225 + 2614404415744 = 3247965^2 + 1616912^2 .
It is a cyclic number.
It is not a de Polignac number, because 13163681056969 - 221 = 13163678959817 is a prime.
It is a super-2 number, since 2×131636810569692 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13163681056969.
It is not a weakly prime, because it can be changed into another prime (13163681054969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6581840528484 + 6581840528485.
It is an arithmetic number, because the mean of its divisors is an integer number (6581840528485).
Almost surely, 213163681056969 is an apocalyptic number.
It is an amenable number.
13163681056969 is a deficient number, since it is larger than the sum of its proper divisors (1).
13163681056969 is an equidigital number, since it uses as much as digits as its factorization.
13163681056969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 37791360, while the sum is 64.
The spelling of 13163681056969 in words is "thirteen trillion, one hundred sixty-three billion, six hundred eighty-one million, fifty-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •