Base | Representation |
---|---|
bin | 11000011011101011… |
… | …10011100011000101 |
3 | 1020212011011020211021 |
4 | 30031311303203011 |
5 | 203330440013334 |
6 | 10005333111141 |
7 | 643024412401 |
oct | 141565634305 |
9 | 36764136737 |
10 | 13117110469 |
11 | 56212a3271 |
12 | 2660a884b1 |
13 | 1310726638 |
14 | 8c6132101 |
15 | 51b8863b4 |
hex | 30dd738c5 |
13117110469 has 2 divisors, whose sum is σ = 13117110470. Its totient is φ = 13117110468.
The previous prime is 13117110421. The next prime is 13117110491. The reversal of 13117110469 is 96401171131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11870102500 + 1247007969 = 108950^2 + 35313^2 .
It is a cyclic number.
It is not a de Polignac number, because 13117110469 - 27 = 13117110341 is a prime.
It is a super-2 number, since 2×131171104692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13117110169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6558555234 + 6558555235.
It is an arithmetic number, because the mean of its divisors is an integer number (6558555235).
Almost surely, 213117110469 is an apocalyptic number.
It is an amenable number.
13117110469 is a deficient number, since it is larger than the sum of its proper divisors (1).
13117110469 is an equidigital number, since it uses as much as digits as its factorization.
13117110469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 34.
The spelling of 13117110469 in words is "thirteen billion, one hundred seventeen million, one hundred ten thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •