Base | Representation |
---|---|
bin | 10001110001001001011… |
… | …001010111110110001110 |
3 | 11022201121201212100011002 |
4 | 101301021121113312032 |
5 | 130001103014200420 |
6 | 2332530504300302 |
7 | 154133366415422 |
oct | 21611131276616 |
9 | 4281551770132 |
10 | 1221002100110 |
11 | 430907943821 |
12 | 17877b171692 |
13 | 8b1a8786690 |
14 | 4314d946b82 |
15 | 21b63900075 |
hex | 11c49657d8e |
1221002100110 has 16 divisors (see below), whose sum is σ = 2366865609696. Its totient is φ = 450831544608.
The previous prime is 1221002100103. The next prime is 1221002100119. The reversal of 1221002100110 is 110012001221.
It is a super-3 number, since 3×12210021001103 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1221002100091 and 1221002100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221002100119) 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, 4696161794 + ... + 4696162053.
It is an arithmetic number, because the mean of its divisors is an integer number (147929100606).
Almost surely, 21221002100110 is an apocalyptic number.
1221002100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1221002100110 is a deficient number, since it is larger than the sum of its proper divisors (1145863509586).
1221002100110 is a wasteful number, since it uses less digits than its factorization.
1221002100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9392323867.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1221002100110 its reverse (110012001221), we get a palindrome (1331014101331).
The spelling of 1221002100110 in words is "one trillion, two hundred twenty-one billion, two million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •