Base | Representation |
---|---|
bin | 11111001101000100… |
… | …100100111000100000 |
3 | 10012111001010121000001 |
4 | 133031010210320200 |
5 | 1022104324100000 |
6 | 23220410505344 |
7 | 2264202231244 |
oct | 371504447040 |
9 | 105431117001 |
10 | 33505300000 |
11 | 13233960887 |
12 | 65b0a35254 |
13 | 320c668c03 |
14 | 189bbc6424 |
15 | d1173146a |
hex | 7cd124e20 |
33505300000 has 144 divisors (see below), whose sum is σ = 87303552840. Its totient is φ = 12613120000.
The previous prime is 33505299991. The next prime is 33505300007. The reversal of 33505300000 is 350533.
It can be written as a sum of positive squares in 12 ways, for example, as 10499691024 + 23005608976 = 102468^2 + 151676^2 .
It is a super-2 number, since 2×335053000002 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (33505300007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1690146 + ... + 1709854.
Almost surely, 233505300000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 33505300000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43651776420).
33505300000 is an abundant number, since it is smaller than the sum of its proper divisors (53798252840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33505300000 is an equidigital number, since it uses as much as digits as its factorization.
33505300000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19761 (or 19733 counting only the distinct ones).
The product of its (nonzero) digits is 675, while the sum is 19.
Adding to 33505300000 its reverse (350533), we get a palindrome (33505650533).
The spelling of 33505300000 in words is "thirty-three billion, five hundred five million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •