Base | Representation |
---|---|
bin | 11000111010001110… |
… | …01011111001110001 |
3 | 1021112000021021222010 |
4 | 30131013023321301 |
5 | 204342032344123 |
6 | 10051004433133 |
7 | 652255246314 |
oct | 143507137161 |
9 | 37460237863 |
10 | 13373324913 |
11 | 5742990a43 |
12 | 27128487a9 |
13 | 1351833810 |
14 | 90c18897b |
15 | 5340e6993 |
hex | 31d1cbe71 |
13373324913 has 32 divisors (see below), whose sum is σ = 19508874112. Its totient is φ = 8099481600.
The previous prime is 13373324903. The next prime is 13373324959. The reversal of 13373324913 is 31942337331.
It is not a de Polignac number, because 13373324913 - 24 = 13373324897 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (13373324903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 674958 + ... + 694488.
It is an arithmetic number, because the mean of its divisors is an integer number (609652316).
Almost surely, 213373324913 is an apocalyptic number.
13373324913 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13373324913 is a deficient number, since it is larger than the sum of its proper divisors (6135549199).
13373324913 is a wasteful number, since it uses less digits than its factorization.
13373324913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19825.
The product of its digits is 122472, while the sum is 39.
The spelling of 13373324913 in words is "thirteen billion, three hundred seventy-three million, three hundred twenty-four thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •