Base | Representation |
---|---|
bin | 1000001100110101… |
… | …0111101110001011 |
3 | 12200102011122210122 |
4 | 2003031113232023 |
5 | 14002014222311 |
6 | 1002233533455 |
7 | 105356625350 |
oct | 20315275613 |
9 | 5612148718 |
10 | 2201320331 |
11 | a2a651601 |
12 | 51527428b |
13 | 2910a4612 |
14 | 16c502627 |
15 | cd3cd0db |
hex | 83357b8b |
2201320331 has 4 divisors (see below), whose sum is σ = 2515794672. Its totient is φ = 1886845992.
The previous prime is 2201320249. The next prime is 2201320333. The reversal of 2201320331 is 1330231022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2201320331 - 214 = 2201303947 is a prime.
It is a super-2 number, since 2×22013203312 = 9691622399347899122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2201320333) 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 3 ways as a sum of consecutive naturals, for example, 157237160 + ... + 157237173.
It is an arithmetic number, because the mean of its divisors is an integer number (628948668).
Almost surely, 22201320331 is an apocalyptic number.
2201320331 is a deficient number, since it is larger than the sum of its proper divisors (314474341).
2201320331 is an equidigital number, since it uses as much as digits as its factorization.
2201320331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314474340.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 2201320331 is about 46918.2302628733. The cubic root of 2201320331 is about 1300.8515783350.
Adding to 2201320331 its reverse (1330231022), we get a palindrome (3531551353).
The spelling of 2201320331 in words is "two billion, two hundred one million, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •