Base | Representation |
---|---|
bin | 1100000000111011… |
… | …0111011000011011 |
3 | 22022202122012010020 |
4 | 3000032313120123 |
5 | 23101112403311 |
6 | 1252005321523 |
7 | 142631042004 |
oct | 30016673033 |
9 | 8282565106 |
10 | 3225122331 |
11 | 1405552162 |
12 | 7601062a3 |
13 | 3c5226612 |
14 | 2284881ab |
15 | 13d211c06 |
hex | c03b761b |
3225122331 has 8 divisors (see below), whose sum is σ = 4301677584. Its totient is φ = 2149324320.
The previous prime is 3225122323. The next prime is 3225122333. The reversal of 3225122331 is 1332215223.
It is a happy number.
3225122331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3225122331 - 23 = 3225122323 is a prime.
It is a super-2 number, since 2×32251223312 = 20802828099829747122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3225122333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 179296 + ... + 196461.
It is an arithmetic number, because the mean of its divisors is an integer number (537709698).
Almost surely, 23225122331 is an apocalyptic number.
3225122331 is a deficient number, since it is larger than the sum of its proper divisors (1076555253).
3225122331 is a wasteful number, since it uses less digits than its factorization.
3225122331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378621.
The product of its digits is 2160, while the sum is 24.
The square root of 3225122331 is about 56790.1605121873. The cubic root of 3225122331 is about 1477.4588624058.
Adding to 3225122331 its reverse (1332215223), we get a palindrome (4557337554).
The spelling of 3225122331 in words is "three billion, two hundred twenty-five million, one hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •