Base | Representation |
---|---|
bin | 11001000101101001… |
… | …01011001101000001 |
3 | 1021202200112222122002 |
4 | 30202310223031001 |
5 | 210041044320211 |
6 | 10104310153345 |
7 | 654530523101 |
oct | 144264531501 |
9 | 37680488562 |
10 | 13469135681 |
11 | 5791a80aa1 |
12 | 273a952855 |
13 | 136863b591 |
14 | 91aba9201 |
15 | 53c72003b |
hex | 322d2b341 |
13469135681 has 2 divisors, whose sum is σ = 13469135682. Its totient is φ = 13469135680.
The previous prime is 13469135671. The next prime is 13469135689. The reversal of 13469135681 is 18653196431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11964859456 + 1504276225 = 109384^2 + 38785^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13469135681 is a prime.
It is a super-2 number, since 2×134691356812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13469135689) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6734567840 + 6734567841.
It is an arithmetic number, because the mean of its divisors is an integer number (6734567841).
Almost surely, 213469135681 is an apocalyptic number.
It is an amenable number.
13469135681 is a deficient number, since it is larger than the sum of its proper divisors (1).
13469135681 is an equidigital number, since it uses as much as digits as its factorization.
13469135681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 466560, while the sum is 47.
The spelling of 13469135681 in words is "thirteen billion, four hundred sixty-nine million, one hundred thirty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •