Base | Representation |
---|---|
bin | 11110110001111100… |
… | …100110011110100000 |
3 | 10011022022211100211112 |
4 | 132301330212132200 |
5 | 1020141324141134 |
6 | 23103313002452 |
7 | 2250005162531 |
oct | 366174463640 |
9 | 104268740745 |
10 | 33050224544 |
11 | 1301aa98967 |
12 | 64a4553428 |
13 | 31692b2cac |
14 | 18575a6688 |
15 | cd67de1ce |
hex | 7b1f267a0 |
33050224544 has 24 divisors (see below), whose sum is σ = 66826216548. Its totient is φ = 16078487040.
The previous prime is 33050224541. The next prime is 33050224553. The reversal of 33050224544 is 44542205033.
It can be written as a sum of positive squares in 2 ways, for example, as 28972124944 + 4078099600 = 170212^2 + 63860^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 33050224544.
It is not an unprimeable number, because it can be changed into a prime (33050224541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13955837 + ... + 13958204.
Almost surely, 233050224544 is an apocalyptic number.
It is an amenable number.
33050224544 is an abundant number, since it is smaller than the sum of its proper divisors (33775992004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33050224544 is a wasteful number, since it uses less digits than its factorization.
33050224544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27914088 (or 27914080 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 32.
Adding to 33050224544 its reverse (44542205033), we get a palindrome (77592429577).
The spelling of 33050224544 in words is "thirty-three billion, fifty million, two hundred twenty-four thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •