Base | Representation |
---|---|
bin | 11110010000111010001000… |
… | …111000100001111001000101 |
3 | 122110021112222010121000220002 |
4 | 132100322020320201321011 |
5 | 114421231111223221201 |
6 | 1151030454350451045 |
7 | 40015253450156264 |
oct | 3620721070417105 |
9 | 573245863530802 |
10 | 133103333023301 |
11 | 39457896549813 |
12 | 12b18398b03a85 |
13 | 593678a299c54 |
14 | 24c2342a4a5db |
15 | 105c4ca94e76b |
hex | 790e88e21e45 |
133103333023301 has 8 divisors (see below), whose sum is σ = 135293043072000. Its totient is φ = 130913870981040.
The previous prime is 133103333023277. The next prime is 133103333023303. The reversal of 133103333023301 is 103320333301331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133103333023301 - 242 = 128705286512197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133103333023303) 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, 60919241 + ... + 63066318.
It is an arithmetic number, because the mean of its divisors is an integer number (16911630384000).
Almost surely, 2133103333023301 is an apocalyptic number.
It is an amenable number.
133103333023301 is a deficient number, since it is larger than the sum of its proper divisors (2189710048699).
133103333023301 is a wasteful number, since it uses less digits than its factorization.
133103333023301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124003219.
The product of its (nonzero) digits is 13122, while the sum is 29.
Adding to 133103333023301 its reverse (103320333301331), we get a palindrome (236423666324632).
The spelling of 133103333023301 in words is "one hundred thirty-three trillion, one hundred three billion, three hundred thirty-three million, twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •