Base | Representation |
---|---|
bin | 1000001100110111… |
… | …0011001001010101 |
3 | 12200102101100220000 |
4 | 2003031303021111 |
5 | 14002031321121 |
6 | 1002240201513 |
7 | 105360604011 |
oct | 20315631125 |
9 | 5612340800 |
10 | 2201432661 |
11 | a2a718a3a |
12 | 515309299 |
13 | 29111379c |
14 | 16c531541 |
15 | cd401526 |
hex | 83373255 |
2201432661 has 10 divisors (see below), whose sum is σ = 3288560022. Its totient is φ = 1467621720.
The previous prime is 2201432641. The next prime is 2201432669. The reversal of 2201432661 is 1662341022.
2201432661 is a `hidden beast` number, since 220 + 1 + 432 + 6 + 6 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1707259761 + 494172900 = 41319^2 + 22230^2 .
It is not a de Polignac number, because 2201432661 - 211 = 2201430613 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201432669) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 13589010 + ... + 13589171.
Almost surely, 22201432661 is an apocalyptic number.
It is an amenable number.
2201432661 is a deficient number, since it is larger than the sum of its proper divisors (1087127361).
2201432661 is an equidigital number, since it uses as much as digits as its factorization.
2201432661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27178193 (or 27178184 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 2201432661 is about 46919.4273302648. The cubic root of 2201432661 is about 1300.8737047789.
Adding to 2201432661 its reverse (1662341022), we get a palindrome (3863773683).
The spelling of 2201432661 in words is "two billion, two hundred one million, four hundred thirty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •