Base | Representation |
---|---|
bin | 11000010010111111… |
… | …10100111110111001 |
3 | 1020200002001001202121 |
4 | 30021133310332321 |
5 | 203203311142223 |
6 | 5554211201241 |
7 | 641151133066 |
oct | 141137647671 |
9 | 36602031677 |
10 | 13044240313 |
11 | 55941518a5 |
12 | 26405a6221 |
13 | 12cb5c15c0 |
14 | 8ba5a3c6d |
15 | 51529015d |
hex | 3097f4fb9 |
13044240313 has 8 divisors (see below), whose sum is σ = 14141925000. Its totient is φ = 11960024448.
The previous prime is 13044240299. The next prime is 13044240317. The reversal of 13044240313 is 31304244031.
It can be written as a sum of positive squares in 4 ways, for example, as 1734555904 + 11309684409 = 41648^2 + 106347^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13044240313 - 29 = 13044239801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13044240317) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3365188 + ... + 3369061.
It is an arithmetic number, because the mean of its divisors is an integer number (1767740625).
Almost surely, 213044240313 is an apocalyptic number.
13044240313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13044240313 is a deficient number, since it is larger than the sum of its proper divisors (1097684687).
13044240313 is a wasteful number, since it uses less digits than its factorization.
13044240313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6734411.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 13044240313 its reverse (31304244031), we get a palindrome (44348484344).
The spelling of 13044240313 in words is "thirteen billion, forty-four million, two hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •