Base | Representation |
---|---|
bin | 11101011001011111101… |
… | …10110110011000001101 |
3 | 10120120022000101222111021 |
4 | 32230233312312120031 |
5 | 113022211234102341 |
6 | 2052013125554141 |
7 | 132656502136045 |
oct | 16545766663015 |
9 | 3516260358437 |
10 | 1010120222221 |
11 | 35a431593710 |
12 | 143927275951 |
13 | 7433bb5a106 |
14 | 36c66542725 |
15 | 1b41ee709d1 |
hex | eb2fdb660d |
1010120222221 has 16 divisors (see below), whose sum is σ = 1110977150976. Its totient is φ = 910775710000.
The previous prime is 1010120222191. The next prime is 1010120222227. The reversal of 1010120222221 is 1222220210101.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010120222221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010120222195 and 1010120222204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010120222227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2416116 + ... + 2803186.
It is an arithmetic number, because the mean of its divisors is an integer number (69436071936).
Almost surely, 21010120222221 is an apocalyptic number.
1010120222221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1010120222221 is a deficient number, since it is larger than the sum of its proper divisors (100856928755).
1010120222221 is a wasteful number, since it uses less digits than its factorization.
1010120222221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 389024.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1010120222221 its reverse (1222220210101), we get a palindrome (2232340432322).
The spelling of 1010120222221 in words is "one trillion, ten billion, one hundred twenty million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •