Base | Representation |
---|---|
bin | 1100000100001… |
… | …11111101110011 |
3 | 21001110112000201 |
4 | 12002013331303 |
5 | 201403021321 |
6 | 14013300031 |
7 | 2336233441 |
oct | 602077563 |
9 | 231415021 |
10 | 101220211 |
11 | 52155274 |
12 | 29a94617 |
13 | 17c80021 |
14 | d62bb91 |
15 | 8d46291 |
hex | 6087f73 |
101220211 has 4 divisors (see below), whose sum is σ = 101242624. Its totient is φ = 101197800.
The previous prime is 101220169. The next prime is 101220233. The reversal of 101220211 is 112022101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112022101 = 4759 ⋅23539.
It is a cyclic number.
It is not a de Polignac number, because 101220211 - 27 = 101220083 is a prime.
It is a super-2 number, since 2×1012202112 = 20491062229769042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101230211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1800 + ... + 14341.
It is an arithmetic number, because the mean of its divisors is an integer number (25310656).
Almost surely, 2101220211 is an apocalyptic number.
101220211 is a deficient number, since it is larger than the sum of its proper divisors (22413).
101220211 is an equidigital number, since it uses as much as digits as its factorization.
101220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22412.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 101220211 is about 10060.8255625470. The cubic root of 101220211 is about 466.0391621014.
Adding to 101220211 its reverse (112022101), we get a palindrome (213242312).
It can be divided in two parts, 10 and 1220211, that added together give a palindrome (1220221).
The spelling of 101220211 in words is "one hundred one million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •