Base | Representation |
---|---|
bin | 1011111011001011100001… |
… | …0010011100011101011101 |
3 | 1201102102122021100122201011 |
4 | 2332302320102130131131 |
5 | 3204304001444432201 |
6 | 43515132432215221 |
7 | 2522156013265201 |
oct | 276627022343535 |
9 | 51372567318634 |
10 | 13111332030301 |
11 | 41a553713499a |
12 | 157909269a511 |
13 | 74151612641b |
14 | 3348400a6b01 |
15 | 17b0c869a151 |
hex | becb849c75d |
13111332030301 has 4 divisors (see below), whose sum is σ = 13390296541632. Its totient is φ = 12832367518972.
The previous prime is 13111332030263. The next prime is 13111332030319. The reversal of 13111332030301 is 10303023311131.
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 a cyclic number.
It is not a de Polignac number, because 13111332030301 - 211 = 13111332028253 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 (13111332034301) 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, 139482255595 + ... + 139482255688.
It is an arithmetic number, because the mean of its divisors is an integer number (3347574135408).
Almost surely, 213111332030301 is an apocalyptic number.
It is an amenable number.
13111332030301 is a deficient number, since it is larger than the sum of its proper divisors (278964511331).
13111332030301 is an equidigital number, since it uses as much as digits as its factorization.
13111332030301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278964511330.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 13111332030301 its reverse (10303023311131), we get a palindrome (23414355341432).
The spelling of 13111332030301 in words is "thirteen trillion, one hundred eleven billion, three hundred thirty-two million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •