Base | Representation |
---|---|
bin | 111101111011110001… |
… | …1111010000010110110 |
3 | 110201022011111011122210 |
4 | 1323313203322002312 |
5 | 4134342103412042 |
6 | 141033411034250 |
7 | 12415631531565 |
oct | 1736743720266 |
9 | 421264434583 |
10 | 133002404022 |
11 | 51451431774 |
12 | 2193a29b986 |
13 | c707c1b367 |
14 | 661a139bdc |
15 | 36d672ea9c |
hex | 1ef78fa0b6 |
133002404022 has 8 divisors (see below), whose sum is σ = 266004808056. Its totient is φ = 44334134672.
The previous prime is 133002404021. The next prime is 133002404033. The reversal of 133002404022 is 220404200331.
It is a sphenic number, since it is the product of 3 distinct primes.
133002404022 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 133002404022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133002404021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11083533663 + ... + 11083533674.
It is an arithmetic number, because the mean of its divisors is an integer number (33250601007).
Almost surely, 2133002404022 is an apocalyptic number.
133002404022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133002404022 is a wasteful number, since it uses less digits than its factorization.
133002404022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22167067342.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 133002404022 its reverse (220404200331), we get a palindrome (353406604353).
The spelling of 133002404022 in words is "one hundred thirty-three billion, two million, four hundred four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •