Base | Representation |
---|---|
bin | 11110101111000001… |
… | …001101001101100100 |
3 | 10011011220101120210212 |
4 | 132233001031031210 |
5 | 1020041240201012 |
6 | 23054400034552 |
7 | 2245540502630 |
oct | 365701151544 |
9 | 104156346725 |
10 | 33001100132 |
11 | 12aa5295a80 |
12 | 6490002a58 |
13 | 315c0732b0 |
14 | 1850c59dc0 |
15 | cd2338b22 |
hex | 7af04d364 |
33001100132 has 96 divisors (see below), whose sum is σ = 78055993344. Its totient is φ = 11789712000.
The previous prime is 33001100129. The next prime is 33001100173. The reversal of 33001100132 is 23100110033.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 577313 + ... + 631895.
It is an arithmetic number, because the mean of its divisors is an integer number (813083264).
Almost surely, 233001100132 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 33001100132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39027996672).
33001100132 is an abundant number, since it is smaller than the sum of its proper divisors (45054893212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33001100132 is a wasteful number, since it uses less digits than its factorization.
33001100132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54769 (or 54767 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 33001100132 its reverse (23100110033), we get a palindrome (56101210165).
Subtracting from 33001100132 its reverse (23100110033), we obtain a palindrome (9900990099).
The spelling of 33001100132 in words is "thirty-three billion, one million, one hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •