Base | Representation |
---|---|
bin | 111110000001111110… |
… | …0100110000000000111 |
3 | 110201211122111102001121 |
4 | 1330003330212000013 |
5 | 4140303302431434 |
6 | 141110152534411 |
7 | 12424034015131 |
oct | 1740374460007 |
9 | 421748442047 |
10 | 133210202119 |
11 | 51548760535 |
12 | 219979b1407 |
13 | c73bca5c07 |
14 | 663998c051 |
15 | 36e9ac97b4 |
hex | 1f03f26007 |
133210202119 has 8 divisors (see below), whose sum is σ = 134283782880. Its totient is φ = 132139140000.
The previous prime is 133210202117. The next prime is 133210202123. The reversal of 133210202119 is 911202012331.
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 133210202119 - 21 = 133210202117 is a prime.
It is a super-2 number, since 2×1332102021192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133210202093 and 133210202102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133210202113) 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 7 ways as a sum of consecutive naturals, for example, 523384 + ... + 735085.
It is an arithmetic number, because the mean of its divisors is an integer number (16785472860).
Almost surely, 2133210202119 is an apocalyptic number.
133210202119 is a deficient number, since it is larger than the sum of its proper divisors (1073580761).
133210202119 is a wasteful number, since it uses less digits than its factorization.
133210202119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1259321.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 133210202119 in words is "one hundred thirty-three billion, two hundred ten million, two hundred two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •