Base | Representation |
---|---|
bin | 11000100101111110… |
… | …00001110100101001 |
3 | 1021002011112221102221 |
4 | 30102333001310221 |
5 | 204020033224223 |
6 | 10022054554041 |
7 | 645123112165 |
oct | 142277016451 |
9 | 37064487387 |
10 | 13203414313 |
11 | 5665a8a661 |
12 | 2685968921 |
13 | 13255830bb |
14 | 8d3799ca5 |
15 | 524232b5d |
hex | 312fc1d29 |
13203414313 has 8 divisors (see below), whose sum is σ = 13225050720. Its totient is φ = 13181796960.
The previous prime is 13203414307. The next prime is 13203414347. The reversal of 13203414313 is 31341430231.
13203414313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13203414313 - 29 = 13203413801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13203414353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2021493 + ... + 2028013.
It is an arithmetic number, because the mean of its divisors is an integer number (1653131340).
Almost surely, 213203414313 is an apocalyptic number.
It is an amenable number.
13203414313 is a deficient number, since it is larger than the sum of its proper divisors (21636407).
13203414313 is a wasteful number, since it uses less digits than its factorization.
13203414313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9527.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13203414313 its reverse (31341430231), we get a palindrome (44544844544).
The spelling of 13203414313 in words is "thirteen billion, two hundred three million, four hundred fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •