Base | Representation |
---|---|
bin | 10001110001001111110… |
… | …110001010010011011111 |
3 | 11022201220021110222100220 |
4 | 101301033312022103133 |
5 | 130001313214410421 |
6 | 2332545331452423 |
7 | 154136152243446 |
oct | 21611766122337 |
9 | 4281807428326 |
10 | 1221110310111 |
11 | 430962a3257a |
12 | 1787ab457113 |
13 | 8b1c5013073 |
14 | 43160073d5d |
15 | 21b6d1773c6 |
hex | 11c4fd8a4df |
1221110310111 has 8 divisors (see below), whose sum is σ = 1629699178800. Its totient is φ = 813297490752.
The previous prime is 1221110310109. The next prime is 1221110310137. The reversal of 1221110310111 is 1110130111221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1221110310111 - 21 = 1221110310109 is a prime.
It is a super-2 number, since 2×12211103101112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221110310181) 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, 194008660 + ... + 194014953.
It is an arithmetic number, because the mean of its divisors is an integer number (203712397350).
Almost surely, 21221110310111 is an apocalyptic number.
1221110310111 is a deficient number, since it is larger than the sum of its proper divisors (408588868689).
1221110310111 is a wasteful number, since it uses less digits than its factorization.
1221110310111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388024665.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 1221110310111 its reverse (1110130111221), we get a palindrome (2331240421332).
The spelling of 1221110310111 in words is "one trillion, two hundred twenty-one billion, one hundred ten million, three hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •