Base | Representation |
---|---|
bin | 1001010010111001010101… |
… | …0011001001010100111111 |
3 | 1100012001012112122002222102 |
4 | 2110232111103021110333 |
5 | 2314422013344140221 |
6 | 33423035413335315 |
7 | 2103246606550214 |
oct | 224562523112477 |
9 | 40161175562872 |
10 | 10220232021311 |
11 | 3290415598294 |
12 | 11908bb03753b |
13 | 5919c0c3b630 |
14 | 27493a251b0b |
15 | 12acb96b530b |
hex | 94b954c953f |
10220232021311 has 8 divisors (see below), whose sum is σ = 11008322290224. Its totient is φ = 9432415834560.
The previous prime is 10220232021301. The next prime is 10220232021313. The reversal of 10220232021311 is 11312023202201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10220232021311 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 (10220232021313) 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, 68443085 + ... + 68592246.
It is an arithmetic number, because the mean of its divisors is an integer number (1376040286278).
Almost surely, 210220232021311 is an apocalyptic number.
10220232021311 is a deficient number, since it is larger than the sum of its proper divisors (788090268913).
10220232021311 is a wasteful number, since it uses less digits than its factorization.
10220232021311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137041081.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10220232021311 its reverse (11312023202201), we get a palindrome (21532255223512).
The spelling of 10220232021311 in words is "ten trillion, two hundred twenty billion, two hundred thirty-two million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •