Base | Representation |
---|---|
bin | 1011111011001011000110… |
… | …1000001111010011111101 |
3 | 1201102102100111010022210201 |
4 | 2332302301220033103331 |
5 | 3204303234344144401 |
6 | 43515113401403501 |
7 | 2522153155521004 |
oct | 276626150172375 |
9 | 51372314108721 |
10 | 13111220303101 |
11 | 41a548a063668 |
12 | 1579061199591 |
13 | 7414c8c37b5b |
14 | 33482d301c3b |
15 | 17b0bd97ab01 |
hex | becb1a0f4fd |
13111220303101 has 8 divisors (see below), whose sum is σ = 13801318183520. Its totient is φ = 12421125788112.
The previous prime is 13111220303099. The next prime is 13111220303117. The reversal of 13111220303101 is 10130302211131.
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 13111220303101 - 21 = 13111220303099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111220343101) 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, 12963151 + ... + 13937923.
It is an arithmetic number, because the mean of its divisors is an integer number (1725164772940).
Almost surely, 213111220303101 is an apocalyptic number.
It is an amenable number.
13111220303101 is a deficient number, since it is larger than the sum of its proper divisors (690097880419).
13111220303101 is an equidigital number, since it uses as much as digits as its factorization.
13111220303101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1682715.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13111220303101 its reverse (10130302211131), we get a palindrome (23241522514232).
The spelling of 13111220303101 in words is "thirteen trillion, one hundred eleven billion, two hundred twenty million, three hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •