Base | Representation |
---|---|
bin | 1100000010000110… |
… | …0101110101100001 |
3 | 22100002212120211020 |
4 | 3000201211311201 |
5 | 23103341444301 |
6 | 1252302440053 |
7 | 143020545405 |
oct | 30041456541 |
9 | 8302776736 |
10 | 3230031201 |
11 | 14082a5281 |
12 | 761893029 |
13 | 3c6254a87 |
14 | 228da5105 |
15 | 13d881436 |
hex | c0865d61 |
3230031201 has 4 divisors (see below), whose sum is σ = 4306708272. Its totient is φ = 2153354132.
The previous prime is 3230031163. The next prime is 3230031221. The reversal of 3230031201 is 1021300323.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3230031201 - 26 = 3230031137 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3230031221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 538338531 + ... + 538338536.
It is an arithmetic number, because the mean of its divisors is an integer number (1076677068).
Almost surely, 23230031201 is an apocalyptic number.
It is an amenable number.
3230031201 is a deficient number, since it is larger than the sum of its proper divisors (1076677071).
3230031201 is a wasteful number, since it uses less digits than its factorization.
3230031201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076677070.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3230031201 is about 56833.3634496499. The cubic root of 3230031201 is about 1478.2080822453.
Adding to 3230031201 its reverse (1021300323), we get a palindrome (4251331524).
The spelling of 3230031201 in words is "three billion, two hundred thirty million, thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •