Base | Representation |
---|---|
bin | 11110000100001010111… |
… | …01010111101110000101 |
3 | 10122202102201111021010022 |
4 | 33002011131113232011 |
5 | 113411121443020401 |
6 | 2110322404104525 |
7 | 134430322330166 |
oct | 17020535275605 |
9 | 3582381437108 |
10 | 1033031220101 |
11 | 369119213501 |
12 | 148260095145 |
13 | 765506565aa |
14 | 37ddb2a376d |
15 | 1bd1154e71b |
hex | f085757b85 |
1033031220101 has 2 divisors, whose sum is σ = 1033031220102. Its totient is φ = 1033031220100.
The previous prime is 1033031220071. The next prime is 1033031220167. The reversal of 1033031220101 is 1010221303301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1023888991876 + 9142228225 = 1011874^2 + 95615^2 .
It is a cyclic number.
It is not a de Polignac number, because 1033031220101 - 26 = 1033031220037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1033031220101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1033031222101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516515610050 + 516515610051.
It is an arithmetic number, because the mean of its divisors is an integer number (516515610051).
Almost surely, 21033031220101 is an apocalyptic number.
It is an amenable number.
1033031220101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033031220101 is an equidigital number, since it uses as much as digits as its factorization.
1033031220101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1033031220101 its reverse (1010221303301), we get a palindrome (2043252523402).
The spelling of 1033031220101 in words is "one trillion, thirty-three billion, thirty-one million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •