Base | Representation |
---|---|
bin | 1000010001010101… |
… | …1101111011000111 |
3 | 12201201201212102012 |
4 | 2010111131323013 |
5 | 14021334020403 |
6 | 1004151004435 |
7 | 106006362623 |
oct | 20425357307 |
9 | 5651655365 |
10 | 2220220103 |
11 | a3a290252 |
12 | 51b66971b |
13 | 294c9100a |
14 | 170c22183 |
15 | cedb2ed8 |
hex | 8455dec7 |
2220220103 has 4 divisors (see below), whose sum is σ = 2220629208. Its totient is φ = 2219811000.
The previous prime is 2220220073. The next prime is 2220220157. The reversal of 2220220103 is 3010220222.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3010220222 = 2 ⋅1505110111.
It is a cyclic number.
It is not a de Polignac number, because 2220220103 - 228 = 1951784647 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220220903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 196301 + ... + 207302.
It is an arithmetic number, because the mean of its divisors is an integer number (555157302).
Almost surely, 22220220103 is an apocalyptic number.
2220220103 is a deficient number, since it is larger than the sum of its proper divisors (409105).
2220220103 is an equidigital number, since it uses as much as digits as its factorization.
2220220103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409104.
The product of its (nonzero) digits is 96, while the sum is 14.
The square root of 2220220103 is about 47119.2116126745. The cubic root of 2220220103 is about 1304.5638610478.
Adding to 2220220103 its reverse (3010220222), we get a palindrome (5230440325).
The spelling of 2220220103 in words is "two billion, two hundred twenty million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •