Base | Representation |
---|---|
bin | 11110010000111000000100… |
… | …011010110000011100010000 |
3 | 122110021100020020202120000022 |
4 | 132100320010122300130100 |
5 | 114421212033310013224 |
6 | 1151025450041043012 |
7 | 40015144413125120 |
oct | 3620700432603420 |
9 | 573240206676008 |
10 | 133101110626064 |
11 | 39456956011889 |
12 | 12b17a78786468 |
13 | 59364c4a25cb9 |
14 | 24c21b181cc80 |
15 | 105c3ea7ab65e |
hex | 790e046b0710 |
133101110626064 has 40 divisors (see below), whose sum is σ = 304231110010368. Its totient is φ = 55203225603840.
The previous prime is 133101110626013. The next prime is 133101110626069. The reversal of 133101110626064 is 460626011101331.
It is a super-2 number, since 2×1331011106260642 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133101110626069) 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, 19167783197 + ... + 19167790140.
Almost surely, 2133101110626064 is an apocalyptic number.
133101110626064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
133101110626064 is an abundant number, since it is smaller than the sum of its proper divisors (171129999384304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133101110626064 is a wasteful number, since it uses less digits than its factorization.
133101110626064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38335573383 (or 38335573377 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 35.
Adding to 133101110626064 its reverse (460626011101331), we get a palindrome (593727121727395).
The spelling of 133101110626064 in words is "one hundred thirty-three trillion, one hundred one billion, one hundred ten million, six hundred twenty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •