Base | Representation |
---|---|
bin | 10001110001001001110… |
… | …111100101011100100011 |
3 | 11022201122021202201101012 |
4 | 101301021313211130203 |
5 | 130001112031121011 |
6 | 2332531350131135 |
7 | 154133523633026 |
oct | 21611167453443 |
9 | 4281567681335 |
10 | 1221010020131 |
11 | 4309113631a0 |
12 | 178781950aab |
13 | 8b1aa2ca595 |
14 | 43150a091bd |
15 | 21b64466a8b |
hex | 11c49de5723 |
1221010020131 has 8 divisors (see below), whose sum is σ = 1332309441024. Its totient is φ = 1109760350920.
The previous prime is 1221010020119. The next prime is 1221010020137. The reversal of 1221010020131 is 1310200101221.
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 1221010020131 - 26 = 1221010020067 is a prime.
It is a super-2 number, since 2×12210100201312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1221010020137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12386591 + ... + 12484776.
It is an arithmetic number, because the mean of its divisors is an integer number (166538680128).
Almost surely, 21221010020131 is an apocalyptic number.
1221010020131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1221010020131 is a deficient number, since it is larger than the sum of its proper divisors (111299420893).
1221010020131 is a wasteful number, since it uses less digits than its factorization.
1221010020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24875841.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1221010020131 its reverse (1310200101221), we get a palindrome (2531210121352).
The spelling of 1221010020131 in words is "one trillion, two hundred twenty-one billion, ten million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •