Base | Representation |
---|---|
bin | 11110110111010111… |
… | …011011001011001101 |
3 | 10011112122220110102220 |
4 | 132313113123023031 |
5 | 1020333113022341 |
6 | 23120321405553 |
7 | 2252161026615 |
oct | 366727331315 |
9 | 104478813386 |
10 | 33141142221 |
11 | 13067346740 |
12 | 650aa998b9 |
13 | 3182096835 |
14 | 18656b1a45 |
15 | cde79ca66 |
hex | 7b75db2cd |
33141142221 has 64 divisors (see below), whose sum is σ = 51523153920. Its totient is φ = 18751040000.
The previous prime is 33141142211. The next prime is 33141142231. The reversal of 33141142221 is 12224114133.
It is an interprime number because it is at equal distance from previous prime (33141142211) and next prime (33141142231).
It is not a de Polignac number, because 33141142221 - 25 = 33141142189 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 33141142191 and 33141142200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33141142211) 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 63 ways as a sum of consecutive naturals, for example, 5439745 + ... + 5445833.
It is an arithmetic number, because the mean of its divisors is an integer number (805049280).
Almost surely, 233141142221 is an apocalyptic number.
It is an amenable number.
33141142221 is a deficient number, since it is larger than the sum of its proper divisors (18382011699).
33141142221 is a wasteful number, since it uses less digits than its factorization.
33141142221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6298.
The product of its digits is 1152, while the sum is 24.
Adding to 33141142221 its reverse (12224114133), we get a palindrome (45365256354).
The spelling of 33141142221 in words is "thirty-three billion, one hundred forty-one million, one hundred forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •