Base | Representation |
---|---|
bin | 11110101111110010… |
… | …111101000100100101 |
3 | 10011012210221010211011 |
4 | 132233302331010211 |
5 | 1020103110004341 |
6 | 23055543342221 |
7 | 2246056366405 |
oct | 365762750445 |
9 | 104183833734 |
10 | 33014141221 |
11 | 13001692a36 |
12 | 6494451971 |
13 | 316198b109 |
14 | 1852892805 |
15 | cd3562b81 |
hex | 7afcbd125 |
33014141221 has 4 divisors (see below), whose sum is σ = 33255120492. Its totient is φ = 32773161952.
The previous prime is 33014141191. The next prime is 33014141267. The reversal of 33014141221 is 12214141033.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7342090596 + 25672050625 = 85686^2 + 160225^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33014141221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 33014141192 and 33014141201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33014141621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 120489430 + ... + 120489703.
It is an arithmetic number, because the mean of its divisors is an integer number (8313780123).
Almost surely, 233014141221 is an apocalyptic number.
It is an amenable number.
33014141221 is a deficient number, since it is larger than the sum of its proper divisors (240979271).
33014141221 is a wasteful number, since it uses less digits than its factorization.
33014141221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240979270.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 33014141221 its reverse (12214141033), we get a palindrome (45228282254).
The spelling of 33014141221 in words is "thirty-three billion, fourteen million, one hundred forty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •