Base | Representation |
---|---|
bin | 11000010010111001… |
… | …10011100000111101 |
3 | 1020200000112210201211 |
4 | 30021130303200331 |
5 | 203203110312434 |
6 | 5554142204421 |
7 | 641141322544 |
oct | 141134634075 |
9 | 36600483654 |
10 | 13043447869 |
11 | 5593760491 |
12 | 2640283711 |
13 | 12cb3a49ba |
14 | 8ba43915b |
15 | 515185464 |
hex | 30973383d |
13043447869 has 2 divisors, whose sum is σ = 13043447870. Its totient is φ = 13043447868.
The previous prime is 13043447861. The next prime is 13043447881. The reversal of 13043447869 is 96874434031.
13043447869 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10330079769 + 2713368100 = 101637^2 + 52090^2 .
It is a cyclic number.
It is not a de Polignac number, because 13043447869 - 23 = 13043447861 is a prime.
It is a super-2 number, since 2×130434478692 (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 (13043447861) 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, 6521723934 + 6521723935.
It is an arithmetic number, because the mean of its divisors is an integer number (6521723935).
Almost surely, 213043447869 is an apocalyptic number.
It is an amenable number.
13043447869 is a deficient number, since it is larger than the sum of its proper divisors (1).
13043447869 is an equidigital number, since it uses as much as digits as its factorization.
13043447869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1741824, while the sum is 49.
The spelling of 13043447869 in words is "thirteen billion, forty-three million, four hundred forty-seven thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •