Base | Representation |
---|---|
bin | 11110001111011001111011… |
… | …000000111100000000110001 |
3 | 122102220200022011001010221011 |
4 | 132033121323000330000301 |
5 | 114413033020402200223 |
6 | 1150511211034230521 |
7 | 40004635336446100 |
oct | 3617317300740061 |
9 | 572820264033834 |
10 | 133000021131313 |
11 | 39417aa06971a6 |
12 | 12b00365b85441 |
13 | 5929b045a340b |
14 | 24bb341bd6037 |
15 | 1059980ab380d |
hex | 78f67b03c031 |
133000021131313 has 24 divisors (see below), whose sum is σ = 154752607933440. Its totient is φ = 113971802807520.
The previous prime is 133000021131247. The next prime is 133000021131347. The reversal of 133000021131313 is 313131120000331.
It is not a de Polignac number, because 133000021131313 - 221 = 133000019034161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133000021131613) 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 23 ways as a sum of consecutive naturals, for example, 5194691770 + ... + 5194717372.
It is an arithmetic number, because the mean of its divisors is an integer number (6448025330560).
Almost surely, 2133000021131313 is an apocalyptic number.
It is an amenable number.
133000021131313 is a deficient number, since it is larger than the sum of its proper divisors (21752586802127).
133000021131313 is a wasteful number, since it uses less digits than its factorization.
133000021131313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47717 (or 47710 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 133000021131313 its reverse (313131120000331), we get a palindrome (446131141131644).
The spelling of 133000021131313 in words is "one hundred thirty-three trillion, twenty-one million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •