Base | Representation |
---|---|
bin | 11110010110101011111001… |
… | …000101101010101011110101 |
3 | 122111200111202002210110121221 |
4 | 132112223321011222223311 |
5 | 114444232210220202423 |
6 | 1151533114300110341 |
7 | 40056040121122261 |
oct | 3626537105525365 |
9 | 574614662713557 |
10 | 133500352506613 |
11 | 395a01aa708884 |
12 | 12b81319b353b1 |
13 | 596504c285c41 |
14 | 24d76470390a1 |
15 | 10679b5851e5d |
hex | 796af916aaf5 |
133500352506613 has 8 divisors (see below), whose sum is σ = 133585200295520. Its totient is φ = 133415506289520.
The previous prime is 133500352506593. The next prime is 133500352506637. The reversal of 133500352506613 is 316605253005331.
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 133500352506613 - 213 = 133500352498421 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133500352506613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133500352506013) 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, 202840198 + ... + 203497288.
It is an arithmetic number, because the mean of its divisors is an integer number (16698150036940).
Almost surely, 2133500352506613 is an apocalyptic number.
It is an amenable number.
133500352506613 is a deficient number, since it is larger than the sum of its proper divisors (84847788907).
133500352506613 is a wasteful number, since it uses less digits than its factorization.
133500352506613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 785907.
The product of its (nonzero) digits is 729000, while the sum is 43.
The spelling of 133500352506613 in words is "one hundred thirty-three trillion, five hundred billion, three hundred fifty-two million, five hundred six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •