Base | Representation |
---|---|
bin | 1011110111001101001001… |
… | …1110111011101111001101 |
3 | 1201011220101201111111202002 |
4 | 2331303102132323233031 |
5 | 3202144132310110041 |
6 | 43423521223042045 |
7 | 2514220663016441 |
oct | 275632236735715 |
9 | 51156351444662 |
10 | 13043052035021 |
11 | 4179588929928 |
12 | 15679b78a0325 |
13 | 737c54140958 |
14 | 331403aa2821 |
15 | 17942e09059b |
hex | bdcd27bbbcd |
13043052035021 has 2 divisors, whose sum is σ = 13043052035022. Its totient is φ = 13043052035020.
The previous prime is 13043052034997. The next prime is 13043052035063. The reversal of 13043052035021 is 12053025034031.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9602995276900 + 3440056758121 = 3098870^2 + 1854739^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13043052035021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13043052035071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6521526017510 + 6521526017511.
It is an arithmetic number, because the mean of its divisors is an integer number (6521526017511).
Almost surely, 213043052035021 is an apocalyptic number.
It is an amenable number.
13043052035021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13043052035021 is an equidigital number, since it uses as much as digits as its factorization.
13043052035021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 13043052035021 its reverse (12053025034031), we get a palindrome (25096077069052).
The spelling of 13043052035021 in words is "thirteen trillion, forty-three billion, fifty-two million, thirty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •