Base | Representation |
---|---|
bin | 1011111011001011000110… |
… | …0111001100111101000101 |
3 | 1201102102100110121111222001 |
4 | 2332302301213030331011 |
5 | 3204303234312000201 |
6 | 43515113351505301 |
7 | 2522153153306410 |
oct | 276626147147505 |
9 | 51372313544861 |
10 | 13111220031301 |
11 | 41a5489998437 |
12 | 1579061088231 |
13 | 7414c8b71222 |
14 | 33482d270b77 |
15 | 17b0bd925301 |
hex | becb19ccf45 |
13111220031301 has 4 divisors (see below), whose sum is σ = 14984251464352. Its totient is φ = 11238188598252.
The previous prime is 13111220031191. The next prime is 13111220031313. The reversal of 13111220031301 is 10313002211131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 13111220031301 - 215 = 13111219998533 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111220031331) 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, 936515716515 + ... + 936515716528.
It is an arithmetic number, because the mean of its divisors is an integer number (3746062866088).
Almost surely, 213111220031301 is an apocalyptic number.
It is an amenable number.
13111220031301 is a deficient number, since it is larger than the sum of its proper divisors (1873031433051).
13111220031301 is an equidigital number, since it uses as much as digits as its factorization.
13111220031301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1873031433050.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13111220031301 its reverse (10313002211131), we get a palindrome (23424222242432).
The spelling of 13111220031301 in words is "thirteen trillion, one hundred eleven billion, two hundred twenty million, thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •