Base | Representation |
---|---|
bin | 11111001010000101… |
… | …100001000111001101 |
3 | 10012100112220000101000 |
4 | 133022011201013031 |
5 | 1022004013340203 |
6 | 23211421210513 |
7 | 2263023431061 |
oct | 371205410715 |
9 | 105315800330 |
10 | 33455215053 |
11 | 13208662267 |
12 | 6598100a39 |
13 | 3202180c50 |
14 | 18952a9aa1 |
15 | d0c13b4a3 |
hex | 7ca1611cd |
33455215053 has 64 divisors (see below), whose sum is σ = 54019526400. Its totient is φ = 20340460800.
The previous prime is 33455215033. The next prime is 33455215151. The reversal of 33455215053 is 35051255433.
33455215053 is a `hidden beast` number, since 3 + 3 + 4 + 552 + 1 + 50 + 53 = 666.
It is not a de Polignac number, because 33455215053 - 220 = 33454166477 is a prime.
It is a super-2 number, since 2×334552150532 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33455214999 and 33455215017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33455215033) 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 63 ways as a sum of consecutive naturals, for example, 26197651 + ... + 26198927.
It is an arithmetic number, because the mean of its divisors is an integer number (844055100).
Almost surely, 233455215053 is an apocalyptic number.
It is an amenable number.
33455215053 is a deficient number, since it is larger than the sum of its proper divisors (20564311347).
33455215053 is a wasteful number, since it uses less digits than its factorization.
33455215053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2139 (or 2133 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 36.
The spelling of 33455215053 in words is "thirty-three billion, four hundred fifty-five million, two hundred fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •