Base | Representation |
---|---|
bin | 11110010110001001000111… |
… | …010011010101000000101001 |
3 | 122111112221100122021211121212 |
4 | 132112021013103111000221 |
5 | 114443124221030130113 |
6 | 1151504021012442505 |
7 | 40053245543110262 |
oct | 3626110723250051 |
9 | 574487318254555 |
10 | 133463010005033 |
11 | 39586387857725 |
12 | 12b76038019435 |
13 | 596167a958a67 |
14 | 24d5903799969 |
15 | 1066a2c3070a8 |
hex | 7962474d5029 |
133463010005033 has 2 divisors, whose sum is σ = 133463010005034. Its totient is φ = 133463010005032.
The previous prime is 133463010004991. The next prime is 133463010005069. The reversal of 133463010005033 is 330500010364331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86461674519529 + 47001335485504 = 9298477^2 + 6855752^2 .
It is an emirp because it is prime and its reverse (330500010364331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133463010005033 - 226 = 133462942896169 is a prime.
It is not a weakly prime, because it can be changed into another prime (133463010005233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66731505002516 + 66731505002517.
It is an arithmetic number, because the mean of its divisors is an integer number (66731505002517).
Almost surely, 2133463010005033 is an apocalyptic number.
It is an amenable number.
133463010005033 is a deficient number, since it is larger than the sum of its proper divisors (1).
133463010005033 is an equidigital number, since it uses as much as digits as its factorization.
133463010005033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 32.
Adding to 133463010005033 its reverse (330500010364331), we get a palindrome (463963020369364).
The spelling of 133463010005033 in words is "one hundred thirty-three trillion, four hundred sixty-three billion, ten million, five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •