Base | Representation |
---|---|
bin | 1011111011001110000101… |
… | …0100000010010011011111 |
3 | 1201102111102020111001111111 |
4 | 2332303201110002103133 |
5 | 3204311404200011221 |
6 | 43515325020402451 |
7 | 2522212041506203 |
oct | 276634124022337 |
9 | 51374366431444 |
10 | 13112020313311 |
11 | 41a585a701127 |
12 | 15792450a6427 |
13 | 7415c58c258a |
14 | 3348a7670b03 |
15 | 17b118d05be1 |
hex | bece15024df |
13112020313311 has 8 divisors (see below), whose sum is σ = 13522064400000. Its totient is φ = 12708236441880.
The previous prime is 13112020313291. The next prime is 13112020313317. The reversal of 13112020313311 is 11331302021131.
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 13112020313311 - 211 = 13112020311263 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 (13112020313317) 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 7 ways as a sum of consecutive naturals, for example, 1565049561 + ... + 1565057938.
It is an arithmetic number, because the mean of its divisors is an integer number (1690258050000).
Almost surely, 213112020313311 is an apocalyptic number.
13112020313311 is a deficient number, since it is larger than the sum of its proper divisors (410044086689).
13112020313311 is an equidigital number, since it uses as much as digits as its factorization.
13112020313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3130107629.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13112020313311 its reverse (11331302021131), we get a palindrome (24443322334442).
The spelling of 13112020313311 in words is "thirteen trillion, one hundred twelve billion, twenty million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •