Base | Representation |
---|---|
bin | 111110000101111100… |
… | …0011001111110011101 |
3 | 110202011220222121020001 |
4 | 1330023320121332131 |
5 | 4141041342301023 |
6 | 141131310054301 |
7 | 12430241351566 |
oct | 1741370317635 |
9 | 422156877201 |
10 | 133343322013 |
11 | 51606913480 |
12 | 21a144aa391 |
13 | c760744795 |
14 | 664d52116d |
15 | 37066226ad |
hex | 1f0be19f9d |
133343322013 has 16 divisors (see below), whose sum is σ = 145764074880. Its totient is φ = 120972544000.
The previous prime is 133343321989. The next prime is 133343322041. The reversal of 133343322013 is 310223343331.
It is not a de Polignac number, because 133343322013 - 229 = 132806451101 is a prime.
It is a super-3 number, since 3×1333433220133 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133343322083) 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 15 ways as a sum of consecutive naturals, for example, 19931373 + ... + 19938061.
It is an arithmetic number, because the mean of its divisors is an integer number (9110254680).
Almost surely, 2133343322013 is an apocalyptic number.
It is an amenable number.
133343322013 is a deficient number, since it is larger than the sum of its proper divisors (12420752867).
133343322013 is a wasteful number, since it uses less digits than its factorization.
133343322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10148.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 133343322013 its reverse (310223343331), we get a palindrome (443566665344).
The spelling of 133343322013 in words is "one hundred thirty-three billion, three hundred forty-three million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •