Base | Representation |
---|---|
bin | 111101100101000… |
… | …101100001011001 |
3 | 2200000000112211122 |
4 | 331211011201121 |
5 | 4103440211441 |
6 | 250303335025 |
7 | 34413323000 |
oct | 7545054131 |
9 | 2600015748 |
10 | 1033132121 |
11 | 4901a34aa |
12 | 249bb1475 |
13 | 13606a9a8 |
14 | 9b2d3c37 |
15 | 60a7834b |
hex | 3d945859 |
1033132121 has 16 divisors (see below), whose sum is σ = 1206240000. Its totient is φ = 884497824.
The previous prime is 1033132103. The next prime is 1033132123. The reversal of 1033132121 is 1212313301.
1033132121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1033132121 - 222 = 1028937817 is a prime.
It is a zygodrome in base 3.
It is a self number, because there is not a number n which added to its sum of digits gives 1033132121.
It is not an unprimeable number, because it can be changed into a prime (1033132123) 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, 478781 + ... + 480933.
It is an arithmetic number, because the mean of its divisors is an integer number (75390000).
Almost surely, 21033132121 is an apocalyptic number.
It is an amenable number.
1033132121 is a deficient number, since it is larger than the sum of its proper divisors (173107879).
1033132121 is an equidigital number, since it uses as much as digits as its factorization.
1033132121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3573 (or 3559 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1033132121 is about 32142.3726722219. The cubic root of 1033132121 is about 1010.9242661760.
Adding to 1033132121 its reverse (1212313301), we get a palindrome (2245445422).
The spelling of 1033132121 in words is "one billion, thirty-three million, one hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •