Base | Representation |
---|---|
bin | 1000001101111101… |
… | …1101001100010011 |
3 | 12200202002112020020 |
4 | 2003133131030103 |
5 | 14004222430311 |
6 | 1002523314523 |
7 | 105445132455 |
oct | 20337351423 |
9 | 5622075206 |
10 | 2206061331 |
11 | a3229a591 |
12 | 51697ba43 |
13 | 292074546 |
14 | 16cdb82d5 |
15 | cda17c06 |
hex | 837dd313 |
2206061331 has 4 divisors (see below), whose sum is σ = 2941415112. Its totient is φ = 1470707552.
The previous prime is 2206061317. The next prime is 2206061383. The reversal of 2206061331 is 1331606022.
It is a happy number.
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 2206061331 - 213 = 2206053139 is a prime.
It is a super-2 number, since 2×22060613312 = 9733413192266983122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2206061311) 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, 367676886 + ... + 367676891.
It is an arithmetic number, because the mean of its divisors is an integer number (735353778).
Almost surely, 22206061331 is an apocalyptic number.
2206061331 is a deficient number, since it is larger than the sum of its proper divisors (735353781).
2206061331 is an equidigital number, since it uses as much as digits as its factorization.
2206061331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 735353780.
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 2206061331 is about 46968.7271596751. The cubic root of 2206061331 is about 1301.7847932771.
Adding to 2206061331 its reverse (1331606022), we get a palindrome (3537667353).
The spelling of 2206061331 in words is "two billion, two hundred six million, sixty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •