Base | Representation |
---|---|
bin | 11110000100000111001… |
… | …10101111011010010001 |
3 | 10122202100112222022112211 |
4 | 33002003212233122101 |
5 | 113411041012401001 |
6 | 2110315333352121 |
7 | 134426464106161 |
oct | 17020346573221 |
9 | 3582315868484 |
10 | 1033000122001 |
11 | 369102702aa1 |
12 | 148251798641 |
13 | 76547088853 |
14 | 37dd70ca5a1 |
15 | 1bd0d95a351 |
hex | f0839af691 |
1033000122001 has 2 divisors, whose sum is σ = 1033000122002. Its totient is φ = 1033000122000.
The previous prime is 1033000121999. The next prime is 1033000122059. The reversal of 1033000122001 is 1002210003301.
1033000122001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1021362890625 + 11637231376 = 1010625^2 + 107876^2 .
It is a cyclic number.
It is not a de Polignac number, because 1033000122001 - 21 = 1033000121999 is a prime.
Together with 1033000121999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1033030122001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516500061000 + 516500061001.
It is an arithmetic number, because the mean of its divisors is an integer number (516500061001).
Almost surely, 21033000122001 is an apocalyptic number.
It is an amenable number.
1033000122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033000122001 is an equidigital number, since it uses as much as digits as its factorization.
1033000122001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 1033000122001 its reverse (1002210003301), we get a palindrome (2035210125302).
The spelling of 1033000122001 in words is "one trillion, thirty-three billion, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •