Base | Representation |
---|---|
bin | 1011111011001101… |
… | …0001100010011111 |
3 | 22021002110100102222 |
4 | 2332303101202133 |
5 | 23023441042343 |
6 | 1245350535555 |
7 | 142220001461 |
oct | 27663214237 |
9 | 8232410388 |
10 | 3201112223 |
11 | 13a2a42aa1 |
12 | 7540675bb |
13 | 3c026ab5a |
14 | 2251d8131 |
15 | 13b06ca68 |
hex | becd189f |
3201112223 has 8 divisors (see below), whose sum is σ = 3393988128. Its totient is φ = 3008744704.
The previous prime is 3201112219. The next prime is 3201112231. The reversal of 3201112223 is 3222111023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3201112223 - 22 = 3201112219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3201112273) 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 7 ways as a sum of consecutive naturals, for example, 114086 + ... + 139347.
It is an arithmetic number, because the mean of its divisors is an integer number (424248516).
Almost surely, 23201112223 is an apocalyptic number.
3201112223 is a deficient number, since it is larger than the sum of its proper divisors (192875905).
3201112223 is a wasteful number, since it uses less digits than its factorization.
3201112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254193.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 3201112223 is about 56578.3723961727. The cubic root of 3201112223 is about 1473.7833073703.
Adding to 3201112223 its reverse (3222111023), we get a palindrome (6423223246).
The spelling of 3201112223 in words is "three billion, two hundred one million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •