Base | Representation |
---|---|
bin | 11000010001011101… |
… | …00000011111000101 |
3 | 1020122011201012111022 |
4 | 30020232200133011 |
5 | 203142003430201 |
6 | 5553030120525 |
7 | 640633214141 |
oct | 141056403705 |
9 | 36564635438 |
10 | 13031311301 |
11 | 5587921068 |
12 | 26381b0145 |
13 | 12c8a157b8 |
14 | 8b899a221 |
15 | 51408941b |
hex | 308ba07c5 |
13031311301 has 4 divisors (see below), whose sum is σ = 13349148204. Its totient is φ = 12713474400.
The previous prime is 13031311247. The next prime is 13031311303. The reversal of 13031311301 is 10311313031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7308540100 + 5722771201 = 85490^2 + 75649^2 .
It is a cyclic number.
It is not a de Polignac number, because 13031311301 - 222 = 13027116997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13031311301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031311303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 158918390 + ... + 158918471.
It is an arithmetic number, because the mean of its divisors is an integer number (3337287051).
Almost surely, 213031311301 is an apocalyptic number.
It is an amenable number.
13031311301 is a deficient number, since it is larger than the sum of its proper divisors (317836903).
13031311301 is an equidigital number, since it uses as much as digits as its factorization.
13031311301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317836902.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 13031311301 its reverse (10311313031), we get a palindrome (23342624332).
The spelling of 13031311301 in words is "thirteen billion, thirty-one million, three hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •