Base | Representation |
---|---|
bin | 111110100101011… |
… | …1000100101100110 |
3 | 12102100112022121012 |
4 | 1331022320211212 |
5 | 13300100131342 |
6 | 544214222222 |
7 | 103016515130 |
oct | 17512704546 |
9 | 5370468535 |
10 | 2100005222 |
11 | 988442007 |
12 | 4a7354972 |
13 | 2760c0353 |
14 | 15cc8c050 |
15 | c4568b82 |
hex | 7d2b8966 |
2100005222 has 8 divisors (see below), whose sum is σ = 3600008976. Its totient is φ = 900002232.
The previous prime is 2100005209. The next prime is 2100005239. The reversal of 2100005222 is 2225000012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 150000373 = 2100005222 / (2 + 1 + 0 + 0 + 0 + 0 + 5 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 2100005197 and 2100005206.
It is a congruent number.
It is an unprimeable number.
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, 75000173 + ... + 75000200.
It is an arithmetic number, because the mean of its divisors is an integer number (450001122).
Almost surely, 22100005222 is an apocalyptic number.
2100005222 is a deficient number, since it is larger than the sum of its proper divisors (1500003754).
2100005222 is a wasteful number, since it uses less digits than its factorization.
2100005222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150000382.
The product of its (nonzero) digits is 80, while the sum is 14.
The square root of 2100005222 is about 45825.8139262141. The cubic root of 2100005222 is about 1280.5802264445.
Adding to 2100005222 its reverse (2225000012), we get a palindrome (4325005234).
The spelling of 2100005222 in words is "two billion, one hundred million, five thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •