Base | Representation |
---|---|
bin | 111110000010101010… |
… | …0101101001101100000 |
3 | 110201220020221220211112 |
4 | 1330011110231031200 |
5 | 4140330211102240 |
6 | 141112340002452 |
7 | 12424434236621 |
oct | 1740524551540 |
9 | 421806856745 |
10 | 133233300320 |
11 | 5155a7a755a |
12 | 219a3690428 |
13 | c743a025a3 |
14 | 663ca81a48 |
15 | 36ebb3d665 |
hex | 1f0552d360 |
133233300320 has 72 divisors (see below), whose sum is σ = 334368445824. Its totient is φ = 50158401536.
The previous prime is 133233300289. The next prime is 133233300349. The reversal of 133233300320 is 23003332331.
It is a super-2 number, since 2×1332333003202 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1394432 + ... + 1486911.
It is an arithmetic number, because the mean of its divisors is an integer number (4644006192).
Almost surely, 2133233300320 is an apocalyptic number.
133233300320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133233300320 is an abundant number, since it is smaller than the sum of its proper divisors (201135145504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133233300320 is a wasteful number, since it uses less digits than its factorization.
133233300320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2881392 (or 2881367 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 133233300320 its reverse (23003332331), we get a palindrome (156236632651).
The spelling of 133233300320 in words is "one hundred thirty-three billion, two hundred thirty-three million, three hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •