Base | Representation |
---|---|
bin | 11110000100001010111… |
… | …01000010011111010001 |
3 | 10122202102201022211211102 |
4 | 33002011131002133101 |
5 | 113411121432230022 |
6 | 2110322402154145 |
7 | 134430321515513 |
oct | 17020535023721 |
9 | 3582381284742 |
10 | 1033031133137 |
11 | 369119164133 |
12 | 148260052955 |
13 | 76550625b33 |
14 | 37ddb27dbb3 |
15 | 1bd11533a92 |
hex | f0857427d1 |
1033031133137 has 2 divisors, whose sum is σ = 1033031133138. Its totient is φ = 1033031133136.
The previous prime is 1033031133083. The next prime is 1033031133151. The reversal of 1033031133137 is 7313311303301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 569366830096 + 463664303041 = 754564^2 + 680929^2 .
It is an emirp because it is prime and its reverse (7313311303301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1033031133137 - 214 = 1033031116753 is a prime.
It is not a weakly prime, because it can be changed into another prime (1033031138137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516515566568 + 516515566569.
It is an arithmetic number, because the mean of its divisors is an integer number (516515566569).
Almost surely, 21033031133137 is an apocalyptic number.
It is an amenable number.
1033031133137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033031133137 is an equidigital number, since it uses as much as digits as its factorization.
1033031133137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5103, while the sum is 29.
Adding to 1033031133137 its reverse (7313311303301), we get a palindrome (8346342436438).
The spelling of 1033031133137 in words is "one trillion, thirty-three billion, thirty-one million, one hundred thirty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •