Base | Representation |
---|---|
bin | 100001101000011110111… |
… | …110100001110110101001 |
3 | 22011221122100100020201112 |
4 | 201220132332201312221 |
5 | 300331330300111241 |
6 | 4525431200400105 |
7 | 325656663551426 |
oct | 41503676416651 |
9 | 8157570306645 |
10 | 2311212113321 |
11 | 8111a7a91841 |
12 | 313b18316035 |
13 | 139c3c226357 |
14 | 7dc12b18d4d |
15 | 401beb791eb |
hex | 21a1efa1da9 |
2311212113321 has 4 divisors (see below), whose sum is σ = 2323187305812. Its totient is φ = 2299236920832.
The previous prime is 2311212113317. The next prime is 2311212113387. The reversal of 2311212113321 is 1233112121132.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 861993406096 + 1449218707225 = 928436^2 + 1203835^2 .
It is a cyclic number.
It is not a de Polignac number, because 2311212113321 - 22 = 2311212113317 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2311212115321) 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, 5987595956 + ... + 5987596341.
It is an arithmetic number, because the mean of its divisors is an integer number (580796826453).
Almost surely, 22311212113321 is an apocalyptic number.
It is an amenable number.
2311212113321 is a deficient number, since it is larger than the sum of its proper divisors (11975192491).
2311212113321 is a wasteful number, since it uses less digits than its factorization.
2311212113321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11975192490.
The product of its digits is 432, while the sum is 23.
Adding to 2311212113321 its reverse (1233112121132), we get a palindrome (3544324234453).
The spelling of 2311212113321 in words is "two trillion, three hundred eleven billion, two hundred twelve million, one hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •