Base | Representation |
---|---|
bin | 1011110101111000000010… |
… | …0100110111101100000111 |
3 | 1201002201102100001102212201 |
4 | 2331132000210313230013 |
5 | 3201310333433214421 |
6 | 43405222041255331 |
7 | 2512451524433404 |
oct | 275360044675407 |
9 | 51081370042781 |
10 | 13020203023111 |
11 | 416a923197009 |
12 | 156349b794547 |
13 | 735a5243836b |
14 | 3302772792ab |
15 | 178a43157b91 |
hex | bd780937b07 |
13020203023111 has 4 divisors (see below), whose sum is σ = 13372100402152. Its totient is φ = 12668305644072.
The previous prime is 13020203023097. The next prime is 13020203023133. The reversal of 13020203023111 is 11132030202031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13020203023111 - 227 = 13020068805383 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 (13020203023171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 175948689465 + ... + 175948689538.
It is an arithmetic number, because the mean of its divisors is an integer number (3343025100538).
Almost surely, 213020203023111 is an apocalyptic number.
13020203023111 is a deficient number, since it is larger than the sum of its proper divisors (351897379041).
13020203023111 is an equidigital number, since it uses as much as digits as its factorization.
13020203023111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351897379040.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13020203023111 its reverse (11132030202031), we get a palindrome (24152233225142).
The spelling of 13020203023111 in words is "thirteen trillion, twenty billion, two hundred three million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •