Base | Representation |
---|---|
bin | 1011110101010110111010… |
… | …0001000110110111010101 |
3 | 1201001212110120110202111102 |
4 | 2331111232201012313111 |
5 | 3201134130342042323 |
6 | 43401151403315445 |
7 | 2512015252101440 |
oct | 275255641066725 |
9 | 51055416422442 |
10 | 13011310112213 |
11 | 416707a399476 |
12 | 156181951bb85 |
13 | 734c65c114ca |
14 | 32da7217c657 |
15 | 1786c2581328 |
hex | bd56e846dd5 |
13011310112213 has 4 divisors (see below), whose sum is σ = 14870068699680. Its totient is φ = 11152551524748.
The previous prime is 13011310112189. The next prime is 13011310112243. The reversal of 13011310112213 is 31221101311031.
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 13011310112213 - 218 = 13011309850069 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 (13011310112243) 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, 929379293723 + ... + 929379293736.
It is an arithmetic number, because the mean of its divisors is an integer number (3717517174920).
Almost surely, 213011310112213 is an apocalyptic number.
It is an amenable number.
13011310112213 is a deficient number, since it is larger than the sum of its proper divisors (1858758587467).
13011310112213 is an equidigital number, since it uses as much as digits as its factorization.
13011310112213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1858758587466.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 13011310112213 its reverse (31221101311031), we get a palindrome (44232411423244).
The spelling of 13011310112213 in words is "thirteen trillion, eleven billion, three hundred ten million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •