Base | Representation |
---|---|
bin | 1000010001010011… |
… | …0111011111000101 |
3 | 12201201102212110000 |
4 | 2010110313133011 |
5 | 14021314001121 |
6 | 1004143351513 |
7 | 106005135615 |
oct | 20424673705 |
9 | 5651385400 |
10 | 2220062661 |
11 | a3a192a33 |
12 | 51b5b2599 |
13 | 294c3745b |
14 | 170bc0a45 |
15 | ced81526 |
hex | 845377c5 |
2220062661 has 20 divisors (see below), whose sum is σ = 3358379200. Its totient is φ = 1461302856.
The previous prime is 2220062659. The next prime is 2220062671. The reversal of 2220062661 is 1662600222.
2220062661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2220062661 - 21 = 2220062659 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220062671) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 167071 + ... + 179868.
It is an arithmetic number, because the mean of its divisors is an integer number (167918960).
Almost surely, 22220062661 is an apocalyptic number.
It is an amenable number.
2220062661 is a deficient number, since it is larger than the sum of its proper divisors (1138316539).
2220062661 is an equidigital number, since it uses as much as digits as its factorization.
2220062661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347030 (or 347021 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 2220062661 is about 47117.5409056967. The cubic root of 2220062661 is about 1304.5330235648.
Adding to 2220062661 its reverse (1662600222), we get a palindrome (3882662883).
The spelling of 2220062661 in words is "two billion, two hundred twenty million, sixty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •