Base | Representation |
---|---|
bin | 111101100001101… |
… | …000001001110101 |
3 | 2122221022111001021 |
4 | 331201220021311 |
5 | 4103222203042 |
6 | 250232101141 |
7 | 34402525330 |
oct | 7541501165 |
9 | 2587274037 |
10 | 1032225397 |
11 | 48a734245 |
12 | 2498347b1 |
13 | 135b11078 |
14 | 9b139617 |
15 | 60949867 |
hex | 3d868275 |
1032225397 has 16 divisors (see below), whose sum is σ = 1250284032. Its totient is φ = 831916800.
The previous prime is 1032225379. The next prime is 1032225401. The reversal of 1032225397 is 7935222301.
1032225397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1032225397 - 219 = 1031701109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032225367) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 140772 + ... + 147922.
It is an arithmetic number, because the mean of its divisors is an integer number (78142752).
Almost surely, 21032225397 is an apocalyptic number.
1032225397 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1032225397 is a deficient number, since it is larger than the sum of its proper divisors (218058635).
1032225397 is a wasteful number, since it uses less digits than its factorization.
1032225397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8388.
The product of its (nonzero) digits is 22680, while the sum is 34.
The square root of 1032225397 is about 32128.2647679578. The cubic root of 1032225397 is about 1010.6284351572.
Adding to 1032225397 its reverse (7935222301), we get a palindrome (8967447698).
The spelling of 1032225397 in words is "one billion, thirty-two million, two hundred twenty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •