Base | Representation |
---|---|
bin | 11110010000001100100101… |
… | …000001100110110110001001 |
3 | 122110002212200211000110001222 |
4 | 132100030211001212312021 |
5 | 114414430414214303113 |
6 | 1150552204205451425 |
7 | 40011602251163261 |
oct | 3620144501466611 |
9 | 573085624013058 |
10 | 133054413041033 |
11 | 39439072493000 |
12 | 12b0aa05870b75 |
13 | 5931c92202893 |
14 | 24bdc219367a1 |
15 | 105b0b5ce4e08 |
hex | 790325066d89 |
133054413041033 has 8 divisors (see below), whose sum is σ = 146349857771616. Its totient is φ = 120958557308820.
The previous prime is 133054413041021. The next prime is 133054413041063. The reversal of 133054413041033 is 330140314450331.
It is not a de Polignac number, because 133054413041033 - 28 = 133054413040777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133054413040984 and 133054413041002.
It is not an unprimeable number, because it can be changed into a prime (133054413041063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49982873591 + ... + 49982876252.
It is an arithmetic number, because the mean of its divisors is an integer number (18293732221452).
Almost surely, 2133054413041033 is an apocalyptic number.
It is an amenable number.
133054413041033 is a deficient number, since it is larger than the sum of its proper divisors (13295444730583).
133054413041033 is an frugal number, since it uses more digits than its factorization.
133054413041033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99965749876 (or 99965749854 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 133054413041033 its reverse (330140314450331), we get a palindrome (463194727491364).
The spelling of 133054413041033 in words is "one hundred thirty-three trillion, fifty-four billion, four hundred thirteen million, forty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •