Base | Representation |
---|---|
bin | 10001110001001010011… |
… | …110000011001010100011 |
3 | 11022201122222201222221001 |
4 | 101301022132003022203 |
5 | 130001122121301311 |
6 | 2332532350212431 |
7 | 154134005430100 |
oct | 21611236031243 |
9 | 4281588658831 |
10 | 1221020103331 |
11 | 43091701a916 |
12 | 1787851b4117 |
13 | 8b1ac41ac82 |
14 | 431520b1aa7 |
15 | 21b652a94c1 |
hex | 11c4a7832a3 |
1221020103331 has 6 divisors (see below), whose sum is σ = 1420370324340. Its totient is φ = 1046588659956.
The previous prime is 1221020103319. The next prime is 1221020103353. The reversal of 1221020103331 is 1333010201221.
It is not a de Polignac number, because 1221020103331 - 27 = 1221020103203 is a prime.
It is a super-2 number, since 2×12210201033312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1221020103299 and 1221020103308.
It is not an unprimeable number, because it can be changed into a prime (1221020103631) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12459388761 + ... + 12459388858.
It is an arithmetic number, because the mean of its divisors is an integer number (236728387390).
Almost surely, 21221020103331 is an apocalyptic number.
1221020103331 is a deficient number, since it is larger than the sum of its proper divisors (199350221009).
1221020103331 is an equidigital number, since it uses as much as digits as its factorization.
1221020103331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24918777633 (or 24918777626 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1221020103331 its reverse (1333010201221), we get a palindrome (2554030304552).
The spelling of 1221020103331 in words is "one trillion, two hundred twenty-one billion, twenty million, one hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •