Base | Representation |
---|---|
bin | 11000010010111001… |
… | …00110010001101001 |
3 | 1020200000110001100101 |
4 | 30021130212101221 |
5 | 203203102044031 |
6 | 5554141105401 |
7 | 641141005465 |
oct | 141134462151 |
9 | 36600401311 |
10 | 13043393641 |
11 | 5593723773 |
12 | 2640258261 |
13 | 12cb386105 |
14 | 8ba4234a5 |
15 | 515174361 |
hex | 309726469 |
13043393641 has 2 divisors, whose sum is σ = 13043393642. Its totient is φ = 13043393640.
The previous prime is 13043393617. The next prime is 13043393653. The reversal of 13043393641 is 14639334031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7652750400 + 5390643241 = 87480^2 + 73421^2 .
It is a cyclic number.
It is not a de Polignac number, because 13043393641 - 25 = 13043393609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13043393641.
It is not a weakly prime, because it can be changed into another prime (13043397641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6521696820 + 6521696821.
It is an arithmetic number, because the mean of its divisors is an integer number (6521696821).
Almost surely, 213043393641 is an apocalyptic number.
It is an amenable number.
13043393641 is a deficient number, since it is larger than the sum of its proper divisors (1).
13043393641 is an equidigital number, since it uses as much as digits as its factorization.
13043393641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 37.
The spelling of 13043393641 in words is "thirteen billion, forty-three million, three hundred ninety-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •