Base | Representation |
---|---|
bin | 11111010000001000… |
… | …000101000111111101 |
3 | 10012121121120100222102 |
4 | 133100020011013331 |
5 | 1022210434101031 |
6 | 23225441154445 |
7 | 2265363653462 |
oct | 372010050775 |
9 | 105547510872 |
10 | 33556550141 |
11 | 1325a885874 |
12 | 660602ba25 |
13 | 321a17133a |
14 | 18a4927669 |
15 | d15ea67cb |
hex | 7d02051fd |
33556550141 has 8 divisors (see below), whose sum is σ = 34340078784. Its totient is φ = 32773164480.
The previous prime is 33556550117. The next prime is 33556550149. The reversal of 33556550141 is 14105565533.
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 33556550141 - 214 = 33556533757 is a prime.
It is a super-2 number, since 2×335565501412 (a number of 22 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 = 33556550095 and 33556550104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33556550149) 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, 549656 + ... + 607646.
It is an arithmetic number, because the mean of its divisors is an integer number (4292509848).
Almost surely, 233556550141 is an apocalyptic number.
It is an amenable number.
33556550141 is a deficient number, since it is larger than the sum of its proper divisors (783528643).
33556550141 is a wasteful number, since it uses less digits than its factorization.
33556550141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71491.
The product of its (nonzero) digits is 135000, while the sum is 38.
The spelling of 33556550141 in words is "thirty-three billion, five hundred fifty-six million, five hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •