Base | Representation |
---|---|
bin | 11110111011101010… |
… | …010011101110101000 |
3 | 10011201200111102221102 |
4 | 132323222103232220 |
5 | 1021010034420240 |
6 | 23131414100532 |
7 | 2254024360505 |
oct | 367352235650 |
9 | 104650442842 |
10 | 33213201320 |
11 | 130a3a93812 |
12 | 652b04a748 |
13 | 3193ca6660 |
14 | 18710ac4ac |
15 | ce5c83815 |
hex | 7bba93ba8 |
33213201320 has 32 divisors (see below), whose sum is σ = 80478142920. Its totient is φ = 12263335680.
The previous prime is 33213201271. The next prime is 33213201323. The reversal of 33213201320 is 2310231233.
It can be written as a sum of positive squares in 4 ways, for example, as 21640175236 + 11573026084 = 147106^2 + 107578^2 .
It is a super-2 number, since 2×332132013202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 33213201292 and 33213201301.
It is not an unprimeable number, because it can be changed into a prime (33213201323) 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, 31935251 + ... + 31936290.
Almost surely, 233213201320 is an apocalyptic number.
It is an amenable number.
33213201320 is an abundant number, since it is smaller than the sum of its proper divisors (47264941600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33213201320 is a wasteful number, since it uses less digits than its factorization.
33213201320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63871565 (or 63871561 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 33213201320 its reverse (2310231233), we get a palindrome (35523432553).
The spelling of 33213201320 in words is "thirty-three billion, two hundred thirteen million, two hundred one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •