Base | Representation |
---|---|
bin | 11000011001111010… |
… | …10110110000010101 |
3 | 1020211010022102210012 |
4 | 30030331112300111 |
5 | 203313142444334 |
6 | 10004044010005 |
7 | 642454550501 |
oct | 141475266025 |
9 | 36733272705 |
10 | 13102312469 |
11 | 5613a06314 |
12 | 2657b30905 |
13 | 130a644c1c |
14 | 8c419d301 |
15 | 51a4119ce |
hex | 30cf56c15 |
13102312469 has 2 divisors, whose sum is σ = 13102312470. Its totient is φ = 13102312468.
The previous prime is 13102312417. The next prime is 13102312511. The reversal of 13102312469 is 96421320131.
13102312469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13099947025 + 2365444 = 114455^2 + 1538^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13102312469 is a prime.
It is a super-2 number, since 2×131023124692 (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 (13302312469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551156234 + 6551156235.
It is an arithmetic number, because the mean of its divisors is an integer number (6551156235).
Almost surely, 213102312469 is an apocalyptic number.
It is an amenable number.
13102312469 is a deficient number, since it is larger than the sum of its proper divisors (1).
13102312469 is an equidigital number, since it uses as much as digits as its factorization.
13102312469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 13102312469 in words is "thirteen billion, one hundred two million, three hundred twelve thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •