Base | Representation |
---|---|
bin | 11110001111011010110111… |
… | …001001110110100100110100 |
3 | 122102220202220110121010112221 |
4 | 132033122313021312210310 |
5 | 114413042102201220200 |
6 | 1150511455120052124 |
7 | 40005002340526414 |
oct | 3617326711664464 |
9 | 572822813533487 |
10 | 133001030101300 |
11 | 39418469187299 |
12 | 12b005a7a64044 |
13 | 5929c3563138a |
14 | 24bb3d9bda644 |
15 | 10599de46791a |
hex | 78f6b7276934 |
133001030101300 has 72 divisors (see below), whose sum is σ = 291086842999680. Its totient is φ = 52745901072000.
The previous prime is 133001030101267. The next prime is 133001030101301. The reversal of 133001030101300 is 3101030100331.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133001030101301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3740376 + ... + 16732975.
It is an arithmetic number, because the mean of its divisors is an integer number (4042872819440).
Almost surely, 2133001030101300 is an apocalyptic number.
133001030101300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133001030101300 is an abundant number, since it is smaller than the sum of its proper divisors (158085812898380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133001030101300 is a wasteful number, since it uses less digits than its factorization.
133001030101300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20473921 (or 20473914 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 133001030101300 its reverse (3101030100331), we get a palindrome (136102060201631).
The spelling of 133001030101300 in words is "one hundred thirty-three trillion, one billion, thirty million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •