Base | Representation |
---|---|
bin | 111101111100000001… |
… | …0000110111110100001 |
3 | 110201022201101102010210 |
4 | 1323320002012332201 |
5 | 4134401120240223 |
6 | 141034252444333 |
7 | 12416056035222 |
oct | 1737002067641 |
9 | 421281342123 |
10 | 133010321313 |
11 | 5145594a091 |
12 | 21940a796a9 |
13 | c709760c4c |
14 | 661b1db249 |
15 | 36d7295893 |
hex | 1ef8086fa1 |
133010321313 has 32 divisors (see below), whose sum is σ = 192381840000. Its totient is φ = 81456731136.
The previous prime is 133010321303. The next prime is 133010321449. The reversal of 133010321313 is 313123010331.
It is not a de Polignac number, because 133010321313 - 29 = 133010320801 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133010321313.
It is not an unprimeable number, because it can be changed into a prime (133010321303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 510313 + ... + 725561.
It is an arithmetic number, because the mean of its divisors is an integer number (6011932500).
Almost surely, 2133010321313 is an apocalyptic number.
It is an amenable number.
133010321313 is a deficient number, since it is larger than the sum of its proper divisors (59371518687).
133010321313 is a wasteful number, since it uses less digits than its factorization.
133010321313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215601.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 133010321313 its reverse (313123010331), we get a palindrome (446133331644).
The spelling of 133010321313 in words is "one hundred thirty-three billion, ten million, three hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •