Base | Representation |
---|---|
bin | 1000001100100111… |
… | …0111010001111101 |
3 | 12200100102221202010 |
4 | 2003021313101331 |
5 | 14001300313041 |
6 | 1002202121433 |
7 | 105346046220 |
oct | 20311672175 |
9 | 5610387663 |
10 | 2200401021 |
11 | a2a083945 |
12 | 514ab0279 |
13 | 290b42050 |
14 | 16c3435b7 |
15 | cd29aa16 |
hex | 8327747d |
2200401021 has 32 divisors (see below), whose sum is σ = 3687763968. Its totient is φ = 1135949760.
The previous prime is 2200401011. The next prime is 2200401041. The reversal of 2200401021 is 1201040022.
It is not a de Polignac number, because 2200401021 - 222 = 2196206717 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2200400988 and 2200401006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200401011) 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 31 ways as a sum of consecutive naturals, for example, 72915 + ... + 98576.
It is an arithmetic number, because the mean of its divisors is an integer number (115242624).
Almost surely, 22200401021 is an apocalyptic number.
2200401021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2200401021 is a deficient number, since it is larger than the sum of its proper divisors (1487362947).
2200401021 is a wasteful number, since it uses less digits than its factorization.
2200401021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171561.
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 2200401021 is about 46908.4323016662. The cubic root of 2200401021 is about 1300.6704669719.
Adding to 2200401021 its reverse (1201040022), we get a palindrome (3401441043).
The spelling of 2200401021 in words is "two billion, two hundred million, four hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •