Base | Representation |
---|---|
bin | 11000010010000111… |
… | …00111001110001001 |
3 | 1020122120010021210212 |
4 | 30021003213032021 |
5 | 203144413001123 |
6 | 5553344450505 |
7 | 641031226202 |
oct | 141103471611 |
9 | 36576107725 |
10 | 13036843913 |
11 | 558aa5a875 |
12 | 263a019a35 |
13 | 12c9c01b32 |
14 | 8b95da5a9 |
15 | 5147cd878 |
hex | 3090e7389 |
13036843913 has 2 divisors, whose sum is σ = 13036843914. Its totient is φ = 13036843912.
The previous prime is 13036843909. The next prime is 13036843949. The reversal of 13036843913 is 31934863031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10211708809 + 2825135104 = 101053^2 + 53152^2 .
It is an emirp because it is prime and its reverse (31934863031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13036843913 - 22 = 13036843909 is a prime.
It is not a weakly prime, because it can be changed into another prime (13036843903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6518421956 + 6518421957.
It is an arithmetic number, because the mean of its divisors is an integer number (6518421957).
Almost surely, 213036843913 is an apocalyptic number.
It is an amenable number.
13036843913 is a deficient number, since it is larger than the sum of its proper divisors (1).
13036843913 is an equidigital number, since it uses as much as digits as its factorization.
13036843913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 41.
The spelling of 13036843913 in words is "thirteen billion, thirty-six million, eight hundred forty-three thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •