Base | Representation |
---|---|
bin | 11111100001110100… |
… | …011111011111001101 |
3 | 10020101022011011110202 |
4 | 133201310133133031 |
5 | 1023312432431013 |
6 | 23315123543245 |
7 | 2305630124102 |
oct | 374164373715 |
9 | 106338134422 |
10 | 33853405133 |
11 | 133a2401379 |
12 | 668952ab25 |
13 | 326680a792 |
14 | 18d211caa9 |
15 | d32093858 |
hex | 7e1d1f7cd |
33853405133 has 12 divisors (see below), whose sum is σ = 34751056704. Its totient is φ = 32974061400.
The previous prime is 33853405109. The next prime is 33853405147. The reversal of 33853405133 is 33150435833.
It is a happy number.
It is not a de Polignac number, because 33853405133 - 218 = 33853142989 is a prime.
It is a super-2 number, since 2×338534051332 (a number of 22 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33853495133) 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 11 ways as a sum of consecutive naturals, for example, 377948 + ... + 458858.
It is an arithmetic number, because the mean of its divisors is an integer number (2895921392).
Almost surely, 233853405133 is an apocalyptic number.
It is an amenable number.
33853405133 is a deficient number, since it is larger than the sum of its proper divisors (897651571).
33853405133 is an frugal number, since it uses more digits than its factorization.
33853405133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81136 (or 81065 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 38.
The spelling of 33853405133 in words is "thirty-three billion, eight hundred fifty-three million, four hundred five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •