Base | Representation |
---|---|
bin | 1100000001000111000101… |
… | …1110100100001001110111 |
3 | 1201210011122020122102101001 |
4 | 3000101301132210021313 |
5 | 3212441140122142221 |
6 | 44034023154344131 |
7 | 2532423663263413 |
oct | 300216136441167 |
9 | 51704566572331 |
10 | 13213223240311 |
11 | 4234773062076 |
12 | 159498988b047 |
13 | 74b0036ac833 |
14 | 339748383d43 |
15 | 17da8d958391 |
hex | c04717a4277 |
13213223240311 has 4 divisors (see below), whose sum is σ = 13213238149224. Its totient is φ = 13213208331400.
The previous prime is 13213223240303. The next prime is 13213223240363. The reversal of 13213223240311 is 11304232231231.
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 13213223240311 - 23 = 13213223240303 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13213223240311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13213223240381) 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, 6034960 + ... + 7927621.
It is an arithmetic number, because the mean of its divisors is an integer number (3303309537306).
Almost surely, 213213223240311 is an apocalyptic number.
13213223240311 is a deficient number, since it is larger than the sum of its proper divisors (14908913).
13213223240311 is an equidigital number, since it uses as much as digits as its factorization.
13213223240311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14908912.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 13213223240311 its reverse (11304232231231), we get a palindrome (24517455471542).
The spelling of 13213223240311 in words is "thirteen trillion, two hundred thirteen billion, two hundred twenty-three million, two hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •