Base | Representation |
---|---|
bin | 11000110100011101… |
… | …10010101011010111 |
3 | 1021101122022110221120 |
4 | 30122032302223113 |
5 | 204242144041340 |
6 | 10042120415023 |
7 | 651130343610 |
oct | 143216625327 |
9 | 37348273846 |
10 | 13324987095 |
11 | 5718676032 |
12 | 26ba617473 |
13 | 134480ab64 |
14 | 9059a4c07 |
15 | 52ec494d0 |
hex | 31a3b2ad7 |
13324987095 has 64 divisors (see below), whose sum is σ = 25472378880. Its totient is φ = 5815738368.
The previous prime is 13324987069. The next prime is 13324987099. The reversal of 13324987095 is 59078942331.
It is not a de Polignac number, because 13324987095 - 25 = 13324987063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13324987099) 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 63 ways as a sum of consecutive naturals, for example, 1369287 + ... + 1378983.
It is an arithmetic number, because the mean of its divisors is an integer number (398005920).
Almost surely, 213324987095 is an apocalyptic number.
13324987095 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13324987095 is a deficient number, since it is larger than the sum of its proper divisors (12147391785).
13324987095 is a wasteful number, since it uses less digits than its factorization.
13324987095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10304.
The product of its (nonzero) digits is 1632960, while the sum is 51.
The spelling of 13324987095 in words is "thirteen billion, three hundred twenty-four million, nine hundred eighty-seven thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •