Base | Representation |
---|---|
bin | 111101111100010101… |
… | …1111111011001011001 |
3 | 110201100111001012111102 |
4 | 1323320223333121121 |
5 | 4134411423102223 |
6 | 141035324041145 |
7 | 12416251253036 |
oct | 1737053773131 |
9 | 421314035442 |
10 | 133021300313 |
11 | 51461068840 |
12 | 219446931b5 |
13 | c70bb062b5 |
14 | 661c85838d |
15 | 36d8213928 |
hex | 1ef8aff659 |
133021300313 has 8 divisors (see below), whose sum is σ = 145116800640. Its totient is φ = 120926242480.
The previous prime is 133021300309. The next prime is 133021300367. The reversal of 133021300313 is 313003120331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133021300313 - 22 = 133021300309 is a prime.
It is a super-2 number, since 2×1330213003132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133021300303) 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, 1023731 + ... + 1146327.
It is an arithmetic number, because the mean of its divisors is an integer number (18139600080).
Almost surely, 2133021300313 is an apocalyptic number.
It is an amenable number.
133021300313 is a deficient number, since it is larger than the sum of its proper divisors (12095500327).
133021300313 is a wasteful number, since it uses less digits than its factorization.
133021300313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221247.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 133021300313 its reverse (313003120331), we get a palindrome (446024420644).
It can be divided in two parts, 133021 and 300313, that added together give a palindrome (433334).
The spelling of 133021300313 in words is "one hundred thirty-three billion, twenty-one million, three hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •