Base | Representation |
---|---|
bin | 111101100101000… |
… | …101011001010001 |
3 | 2200000000112010101 |
4 | 331211011121101 |
5 | 4103440202401 |
6 | 250303332401 |
7 | 34413321325 |
oct | 7545053121 |
9 | 2600015111 |
10 | 1033131601 |
11 | 4901a3077 |
12 | 249bb1101 |
13 | 13606a698 |
14 | 9b2d3985 |
15 | 60a78101 |
hex | 3d945651 |
1033131601 has 2 divisors, whose sum is σ = 1033131602. Its totient is φ = 1033131600.
The previous prime is 1033131569. The next prime is 1033131611. The reversal of 1033131601 is 1061313301.
1033131601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 592971201 + 440160400 = 24351^2 + 20980^2 .
It is an emirp because it is prime and its reverse (1061313301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1033131601 - 25 = 1033131569 is a prime.
It is not a weakly prime, because it can be changed into another prime (1033131611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516565800 + 516565801.
It is an arithmetic number, because the mean of its divisors is an integer number (516565801).
Almost surely, 21033131601 is an apocalyptic number.
It is an amenable number.
1033131601 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033131601 is an equidigital number, since it uses as much as digits as its factorization.
1033131601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
The square root of 1033131601 is about 32142.3645832101. The cubic root of 1033131601 is about 1010.9240965686.
Adding to 1033131601 its reverse (1061313301), we get a palindrome (2094444902).
The spelling of 1033131601 in words is "one billion, thirty-three million, one hundred thirty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •