Base | Representation |
---|---|
bin | 1011111011000010… |
… | …0111001000001111 |
3 | 22021001010212222010 |
4 | 2332300213020033 |
5 | 23023301223343 |
6 | 1245323552303 |
7 | 142211033466 |
oct | 27660471017 |
9 | 8231125863 |
10 | 3200414223 |
11 | 13a2606636 |
12 | 75398b693 |
13 | 3c0085236 |
14 | 2250959dd |
15 | 13ae80d33 |
hex | bec2720f |
3200414223 has 8 divisors (see below), whose sum is σ = 4272201648. Its totient is φ = 2131118144.
The previous prime is 3200414221. The next prime is 3200414251. The reversal of 3200414223 is 3224140023.
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 3200414223 - 21 = 3200414221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3200414223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3200414221) 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 7 ways as a sum of consecutive naturals, for example, 619836 + ... + 624977.
It is an arithmetic number, because the mean of its divisors is an integer number (534025206).
Almost surely, 23200414223 is an apocalyptic number.
3200414223 is a deficient number, since it is larger than the sum of its proper divisors (1071787425).
3200414223 is a wasteful number, since it uses less digits than its factorization.
3200414223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245673.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 3200414223 is about 56572.2036251020. The cubic root of 3200414223 is about 1473.6761804870.
Adding to 3200414223 its reverse (3224140023), we get a palindrome (6424554246).
The spelling of 3200414223 in words is "three billion, two hundred million, four hundred fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •