Base | Representation |
---|---|
bin | 111011100111100… |
… | …010011000111101 |
3 | 2120201002110012101 |
4 | 323213202120331 |
5 | 4022024021341 |
6 | 243130105101 |
7 | 33533505640 |
oct | 7347423075 |
9 | 2521073171 |
10 | 1000220221 |
11 | 473664290 |
12 | 23ab7b191 |
13 | 12c2b64b0 |
14 | 96ba7a57 |
15 | 5cc26831 |
hex | 3b9e263d |
1000220221 has 16 divisors (see below), whose sum is σ = 1342954368. Its totient is φ = 719438400.
The previous prime is 1000220209. The next prime is 1000220267. The reversal of 1000220221 is 1220220001.
It is a cyclic number.
It is not a de Polignac number, because 1000220221 - 27 = 1000220093 is a prime.
It is a super-3 number, since 3×10002202213 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1000220198 and 1000220207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000221221) 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, 498610 + ... + 500611.
It is an arithmetic number, because the mean of its divisors is an integer number (83934648).
Almost surely, 21000220221 is an apocalyptic number.
1000220221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1000220221 is a deficient number, since it is larger than the sum of its proper divisors (342734147).
1000220221 is a wasteful number, since it uses less digits than its factorization.
1000220221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 999252.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 1000220221 is about 31626.2584097455. The cubic root of 1000220221 is about 1000.0734016121.
Adding to 1000220221 its reverse (1220220001), we get a palindrome (2220440222).
The spelling of 1000220221 in words is "one billion, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •