Base | Representation |
---|---|
bin | 1100001110101011110… |
… | …0010100011101110101 |
3 | 202002022020102111101210 |
4 | 3003222330110131311 |
5 | 11420241112024341 |
6 | 240304010312033 |
7 | 21115322323260 |
oct | 3035274243565 |
9 | 662266374353 |
10 | 210100111221 |
11 | 81115043260 |
12 | 34876128619 |
13 | 16a7398b950 |
14 | a251663cd7 |
15 | 56ea009c16 |
hex | 30eaf14775 |
210100111221 has 64 divisors (see below), whose sum is σ = 379847817216. Its totient is φ = 99749664000.
The previous prime is 210100111219. The next prime is 210100111253. The reversal of 210100111221 is 122111001012.
It is not a de Polignac number, because 210100111221 - 21 = 210100111219 is a prime.
It is a super-2 number, since 2×2101001112212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210100111197 and 210100111206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210100111201) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 43051 + ... + 649656.
It is an arithmetic number, because the mean of its divisors is an integer number (5935122144).
Almost surely, 2210100111221 is an apocalyptic number.
210100111221 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
210100111221 is a deficient number, since it is larger than the sum of its proper divisors (169747705995).
210100111221 is a wasteful number, since it uses less digits than its factorization.
210100111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692842.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210100111221 its reverse (122111001012), we get a palindrome (332211112233).
The spelling of 210100111221 in words is "two hundred ten billion, one hundred million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •