Base | Representation |
---|---|
bin | 111101111100000001… |
… | …0001001001011001001 |
3 | 110201022201101212111010 |
4 | 1323320002021023021 |
5 | 4134401121032223 |
6 | 141034252554133 |
7 | 12416056103400 |
oct | 1737002111311 |
9 | 421281355433 |
10 | 133010330313 |
11 | 51455955923 |
12 | 21940a82949 |
13 | c709765083 |
14 | 661b200637 |
15 | 36d7298393 |
hex | 1ef80892c9 |
133010330313 has 24 divisors (see below), whose sum is σ = 206459878752. Its totient is φ = 75947640384.
The previous prime is 133010330279. The next prime is 133010330329. The reversal of 133010330313 is 313033010331.
It is not a de Polignac number, because 133010330313 - 214 = 133010313929 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 133010330313.
It is not an unprimeable number, because it can be changed into a prime (133010330333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 154020 + ... + 538277.
It is an arithmetic number, because the mean of its divisors is an integer number (8602494948).
Almost surely, 2133010330313 is an apocalyptic number.
It is an amenable number.
133010330313 is a deficient number, since it is larger than the sum of its proper divisors (73449548439).
133010330313 is a wasteful number, since it uses less digits than its factorization.
133010330313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693621 (or 693614 counting only the distinct ones).
The product of its (nonzero) digits is 729, while the sum is 21.
Adding to 133010330313 its reverse (313033010331), we get a palindrome (446043340644).
The spelling of 133010330313 in words is "one hundred thirty-three billion, ten million, three hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •