Base | Representation |
---|---|
bin | 1000001100110010… |
… | …1100110001011101 |
3 | 12200101211201111011 |
4 | 2003030230301131 |
5 | 14001443110123 |
6 | 1002230055221 |
7 | 105355263436 |
oct | 20314546135 |
9 | 5611751434 |
10 | 2201144413 |
11 | a2a541416 |
12 | 5151aa511 |
13 | 291042520 |
14 | 16c49848d |
15 | cd395e0d |
hex | 8332cc5d |
2201144413 has 16 divisors (see below), whose sum is σ = 2476373760. Its totient is φ = 1941249024.
The previous prime is 2201144383. The next prime is 2201144423. The reversal of 2201144413 is 3144411022.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-2201144413 is a prime.
It is a super-2 number, since 2×22011444132 = 9690073453762229138, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201144423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 290173 + ... + 297661.
It is an arithmetic number, because the mean of its divisors is an integer number (154773360).
Almost surely, 22201144413 is an apocalyptic number.
2201144413 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2201144413 is a deficient number, since it is larger than the sum of its proper divisors (275229347).
2201144413 is a wasteful number, since it uses less digits than its factorization.
2201144413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8508.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 2201144413 is about 46916.3554957117. The cubic root of 2201144413 is about 1300.8169249952.
Adding to 2201144413 its reverse (3144411022), we get a palindrome (5345555435).
The spelling of 2201144413 in words is "two billion, two hundred one million, one hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •