Base | Representation |
---|---|
bin | 11110001111100110000111… |
… | …010110100010101001111101 |
3 | 122102221221002112202011020012 |
4 | 132033212013112202221331 |
5 | 114413241323413214401 |
6 | 1150521214111033005 |
7 | 40005610636625603 |
oct | 3617460726425175 |
9 | 572857075664205 |
10 | 133013113023101 |
11 | 394225a9725283 |
12 | 12b029ba50b765 |
13 | 592b10ca0a14c |
14 | 24bbc24841873 |
15 | 1059e9a1178bb |
hex | 78f9875a2a7d |
133013113023101 has 8 divisors (see below), whose sum is σ = 133041859292160. Its totient is φ = 132984369877392.
The previous prime is 133013113023073. The next prime is 133013113023149. The reversal of 133013113023101 is 101320311310331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133013113023101 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 (133013113023151) 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, 85426916 + ... + 86970018.
It is an arithmetic number, because the mean of its divisors is an integer number (16630232411520).
Almost surely, 2133013113023101 is an apocalyptic number.
It is an amenable number.
133013113023101 is a deficient number, since it is larger than the sum of its proper divisors (28746269059).
133013113023101 is an equidigital number, since it uses as much as digits as its factorization.
133013113023101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1561675.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 133013113023101 its reverse (101320311310331), we get a palindrome (234333424333432).
The spelling of 133013113023101 in words is "one hundred thirty-three trillion, thirteen billion, one hundred thirteen million, twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •