Base | Representation |
---|---|
bin | 1011111011001010011001… |
… | …0110111000000111111111 |
3 | 1201102101212022022000021110 |
4 | 2332302212112320013333 |
5 | 3204302342441433203 |
6 | 43515042524333103 |
7 | 2522145401266506 |
oct | 276624626700777 |
9 | 51371768260243 |
10 | 13111031202303 |
11 | 41a53a2345411 |
12 | 15790099a4193 |
13 | 7414989c87a8 |
14 | 33481215983d |
15 | 17b0ac075d03 |
hex | beca65b81ff |
13111031202303 has 8 divisors (see below), whose sum is σ = 17488116703408. Its totient is φ = 8737316584704.
The previous prime is 13111031202271. The next prime is 13111031202397. The reversal of 13111031202303 is 30320213011131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13111031202303 - 25 = 13111031202271 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 13111031202303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111031207303) 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, 842711800 + ... + 842727357.
It is an arithmetic number, because the mean of its divisors is an integer number (2186014587926).
Almost surely, 213111031202303 is an apocalyptic number.
13111031202303 is a deficient number, since it is larger than the sum of its proper divisors (4377085501105).
13111031202303 is a wasteful number, since it uses less digits than its factorization.
13111031202303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1685441753.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13111031202303 its reverse (30320213011131), we get a palindrome (43431244213434).
The spelling of 13111031202303 in words is "thirteen trillion, one hundred eleven billion, thirty-one million, two hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •