Base | Representation |
---|---|
bin | 11110010100011001101000… |
… | …000010100001110110111101 |
3 | 122111010111100212002212211211 |
4 | 132110121220002201312331 |
5 | 114434144034320240203 |
6 | 1151333022203244421 |
7 | 40041510166212406 |
oct | 3624315002416675 |
9 | 574114325085754 |
10 | 133343300165053 |
11 | 3953a637766080 |
12 | 12b569a9519711 |
13 | 59532b0905714 |
14 | 24cdbc8bc49ad |
15 | 1063872a69c6d |
hex | 7946680a1dbd |
133343300165053 has 16 divisors (see below), whose sum is σ = 147307623724800. Its totient is φ = 119686028978880.
The previous prime is 133343300165029. The next prime is 133343300165083. The reversal of 133343300165053 is 350561003343331.
It is a cyclic number.
It is not a de Polignac number, because 133343300165053 - 29 = 133343300164541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133343300164997 and 133343300165015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133343300165083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 195069975 + ... + 195752347.
It is an arithmetic number, because the mean of its divisors is an integer number (9206726482800).
Almost surely, 2133343300165053 is an apocalyptic number.
It is an amenable number.
133343300165053 is a deficient number, since it is larger than the sum of its proper divisors (13964323559747).
133343300165053 is a wasteful number, since it uses less digits than its factorization.
133343300165053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 907332.
The product of its (nonzero) digits is 437400, while the sum is 40.
The spelling of 133343300165053 in words is "one hundred thirty-three trillion, three hundred forty-three billion, three hundred million, one hundred sixty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •