Base | Representation |
---|---|
bin | 111011110000100… |
… | …1111000001111101 |
3 | 12011202010202200111 |
4 | 1313201033001331 |
5 | 13101312413041 |
6 | 530550230021 |
7 | 100455633055 |
oct | 16741170175 |
9 | 5152122614 |
10 | 2005201021 |
11 | 93997a22a |
12 | 47b655311 |
13 | 25c5787a5 |
14 | 150450565 |
15 | bb08d981 |
hex | 7784f07d |
2005201021 has 8 divisors (see below), whose sum is σ = 2012536064. Its totient is φ = 1997876880.
The previous prime is 2005200971. The next prime is 2005201039. The reversal of 2005201021 is 1201025002.
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 2005201021 - 211 = 2005198973 is a prime.
It is a super-2 number, since 2×20052010212 = 8041662269238884882, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2005200992 and 2005201010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2005201921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 564511 + ... + 568051.
It is an arithmetic number, because the mean of its divisors is an integer number (251567008).
Almost surely, 22005201021 is an apocalyptic number.
It is an amenable number.
2005201021 is a deficient number, since it is larger than the sum of its proper divisors (7335043).
2005201021 is a wasteful number, since it uses less digits than its factorization.
2005201021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5451.
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 2005201021 is about 44779.4709772235. The cubic root of 2005201021 is about 1261.0122505210.
Adding to 2005201021 its reverse (1201025002), we get a palindrome (3206226023).
The spelling of 2005201021 in words is "two billion, five million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •