Base | Representation |
---|---|
bin | 1111000110010111101110… |
… | …00000111101011100111101 |
3 | 11100120021221200020021210120 |
4 | 13203023313000331130331 |
5 | 13323004241301002031 |
6 | 154341452401125153 |
7 | 6664633025161446 |
oct | 743136700753475 |
9 | 140507850207716 |
10 | 33204241422141 |
11 | a641926717189 |
12 | 38832553297b9 |
13 | 156b1b9c0ac5a |
14 | 82b1457a02cd |
15 | 3c8aba004a96 |
hex | 1e32f703d73d |
33204241422141 has 8 divisors (see below), whose sum is σ = 44329893189120. Its totient is φ = 22107375301632.
The previous prime is 33204241422083. The next prime is 33204241422197. The reversal of 33204241422141 is 14122414240233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 33204241422141 - 211 = 33204241420093 is a prime.
It is a super-2 number, since 2×332042414221412 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33204241422241) 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, 7196408925 + ... + 7196413538.
It is an arithmetic number, because the mean of its divisors is an integer number (5541236648640).
Almost surely, 233204241422141 is an apocalyptic number.
It is an amenable number.
33204241422141 is a deficient number, since it is larger than the sum of its proper divisors (11125651766979).
33204241422141 is a wasteful number, since it uses less digits than its factorization.
33204241422141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14392823235.
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 33204241422141 its reverse (14122414240233), we get a palindrome (47326655662374).
The spelling of 33204241422141 in words is "thirty-three trillion, two hundred four billion, two hundred forty-one million, four hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •