Base | Representation |
---|---|
bin | 11110111010101001… |
… | …001001111110000100 |
3 | 10011200111100201111120 |
4 | 132322221021332010 |
5 | 1020441201400423 |
6 | 23130004033540 |
7 | 2253426244521 |
oct | 367251117604 |
9 | 104614321446 |
10 | 33196121988 |
11 | 13095388867 |
12 | 65253928b0 |
13 | 31905a6743 |
14 | 186cb04148 |
15 | ce450cee3 |
hex | 7baa49f84 |
33196121988 has 12 divisors (see below), whose sum is σ = 77457618000. Its totient is φ = 11065373992.
The previous prime is 33196121977. The next prime is 33196121989. The reversal of 33196121988 is 88912169133.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×331961219882 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 33196121988.
It is not an unprimeable number, because it can be changed into a prime (33196121989) 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, 1383171738 + ... + 1383171761.
It is an arithmetic number, because the mean of its divisors is an integer number (6454801500).
Almost surely, 233196121988 is an apocalyptic number.
It is an amenable number.
33196121988 is an abundant number, since it is smaller than the sum of its proper divisors (44261496012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33196121988 is a wasteful number, since it uses less digits than its factorization.
33196121988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2766343506 (or 2766343504 counting only the distinct ones).
The product of its digits is 559872, while the sum is 51.
The spelling of 33196121988 in words is "thirty-three billion, one hundred ninety-six million, one hundred twenty-one thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •