Base | Representation |
---|---|
bin | 1000001100110110… |
… | …1110110111011011 |
3 | 12200102100110211202 |
4 | 2003031232313123 |
5 | 14002030241011 |
6 | 1002235544415 |
7 | 105360501626 |
oct | 20315566733 |
9 | 5612313752 |
10 | 2201415131 |
11 | a2a706853 |
12 | 5152bb10b |
13 | 291108806 |
14 | 16c528dbd |
15 | cd3eb23b |
hex | 8336eddb |
2201415131 has 4 divisors (see below), whose sum is σ = 2208066264. Its totient is φ = 2194764000.
The previous prime is 2201415109. The next prime is 2201415133. The reversal of 2201415131 is 1315141022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2201415131 is a prime.
It is a super-2 number, since 2×22014151312 = 9692457157991494322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2201415133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3325070 + ... + 3325731.
It is an arithmetic number, because the mean of its divisors is an integer number (552016566).
Almost surely, 22201415131 is an apocalyptic number.
2201415131 is a deficient number, since it is larger than the sum of its proper divisors (6651133).
2201415131 is an equidigital number, since it uses as much as digits as its factorization.
2201415131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6651132.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 2201415131 is about 46919.2405202812. The cubic root of 2201415131 is about 1300.8702518189.
Adding to 2201415131 its reverse (1315141022), we get a palindrome (3516556153).
The spelling of 2201415131 in words is "two billion, two hundred one million, four hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •