Base | Representation |
---|---|
bin | 111100100010000… |
… | …0010000100111101 |
3 | 12020112212120201010 |
4 | 1321010002010331 |
5 | 13124430201341 |
6 | 533313305433 |
7 | 101222031663 |
oct | 17104020475 |
9 | 5215776633 |
10 | 2031100221 |
11 | 952559727 |
12 | 488265279 |
13 | 264a46067 |
14 | 153a72c33 |
15 | bd4a7716 |
hex | 7910213d |
2031100221 has 8 divisors (see below), whose sum is σ = 2740762080. Its totient is φ = 1337752592.
The previous prime is 2031100199. The next prime is 2031100229. The reversal of 2031100221 is 1220011302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2031100221 - 213 = 2031092029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2031100197 and 2031100206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031100229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4078266 + ... + 4078763.
It is an arithmetic number, because the mean of its divisors is an integer number (342595260).
Almost surely, 22031100221 is an apocalyptic number.
It is an amenable number.
2031100221 is a deficient number, since it is larger than the sum of its proper divisors (709661859).
2031100221 is an equidigital number, since it uses as much as digits as its factorization.
2031100221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8157115.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 2031100221 is about 45067.7292638535. The cubic root of 2031100221 is about 1266.4181258045.
Adding to 2031100221 its reverse (1220011302), we get a palindrome (3251111523).
The spelling of 2031100221 in words is "two billion, thirty-one million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •