Base | Representation |
---|---|
bin | 11110000100101100011… |
… | …00100101010011110101 |
3 | 10122210011021212222121121 |
4 | 33002112030211103311 |
5 | 113412210340010424 |
6 | 2110410314543541 |
7 | 134440302231556 |
oct | 17022614452365 |
9 | 3583137788547 |
10 | 1033312031989 |
11 | 369252781646 |
12 | 14831a137bb1 |
13 | 76596896683 |
14 | 380266c032d |
15 | 1bd2b01cee4 |
hex | f0963254f5 |
1033312031989 has 2 divisors, whose sum is σ = 1033312031990. Its totient is φ = 1033312031988.
The previous prime is 1033312031971. The next prime is 1033312032037. The reversal of 1033312031989 is 9891302133301.
1033312031989 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., 887284873764 + 146027158225 = 941958^2 + 382135^2 .
It is a cyclic number.
It is not a de Polignac number, because 1033312031989 - 25 = 1033312031957 is a prime.
It is a super-2 number, since 2×10333120319892 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1033312031489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516656015994 + 516656015995.
It is an arithmetic number, because the mean of its divisors is an integer number (516656015995).
Almost surely, 21033312031989 is an apocalyptic number.
It is an amenable number.
1033312031989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033312031989 is an equidigital number, since it uses as much as digits as its factorization.
1033312031989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 104976, while the sum is 43.
The spelling of 1033312031989 in words is "one trillion, thirty-three billion, three hundred twelve million, thirty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •