Base | Representation |
---|---|
bin | 11101001001011100001… |
… | …010110100011110111101 |
3 | 21002111002120221112112010 |
4 | 131021130022310132331 |
5 | 230304121240201341 |
6 | 4132055505001433 |
7 | 264466143302262 |
oct | 35113412643675 |
9 | 7074076845463 |
10 | 2003001100221 |
11 | 7025169a2900 |
12 | 284241023279 |
13 | 116b61242614 |
14 | 6cd352a1269 |
15 | 371816dc716 |
hex | 1d25c2b47bd |
2003001100221 has 24 divisors (see below), whose sum is σ = 2936063767392. Its totient is φ = 1213718413600.
The previous prime is 2003001100207. The next prime is 2003001100231. The reversal of 2003001100221 is 1220011003002.
It is not a de Polignac number, because 2003001100221 - 211 = 2003001098173 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2003001100197 and 2003001100206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003001100231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1498051 + ... + 2500031.
It is an arithmetic number, because the mean of its divisors is an integer number (122335990308).
Almost surely, 22003001100221 is an apocalyptic number.
It is an amenable number.
2003001100221 is a deficient number, since it is larger than the sum of its proper divisors (933062667171).
2003001100221 is a wasteful number, since it uses less digits than its factorization.
2003001100221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1007513 (or 1007502 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 2003001100221 its reverse (1220011003002), we get a palindrome (3223012103223).
The spelling of 2003001100221 in words is "two trillion, three billion, one million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •