Base | Representation |
---|---|
bin | 1111000001000011000000… |
… | …01010110010010111011010 |
3 | 11022220210210201002110212220 |
4 | 13200201200022302113122 |
5 | 13312010131413341442 |
6 | 154121441431244510 |
7 | 6645466066640043 |
oct | 740414012622732 |
9 | 138823721073786 |
10 | 33021322012122 |
11 | a58129a459054 |
12 | 3853905b19736 |
13 | 1556b884bac72 |
14 | 822351d798ca |
15 | 3c3e61375eec |
hex | 1e08602b25da |
33021322012122 has 8 divisors (see below), whose sum is σ = 66042644024256. Its totient is φ = 11007107337372.
The previous prime is 33021322012117. The next prime is 33021322012153. The reversal of 33021322012122 is 22121022312033.
It is a sphenic number, since it is the product of 3 distinct primes.
33021322012122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 33021322012092 and 33021322012101.
It is an unprimeable number.
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, 2751776834338 + ... + 2751776834349.
It is an arithmetic number, because the mean of its divisors is an integer number (8255330503032).
Almost surely, 233021322012122 is an apocalyptic number.
33021322012122 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.
33021322012122 is a wasteful number, since it uses less digits than its factorization.
33021322012122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5503553668692.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 33021322012122 its reverse (22121022312033), we get a palindrome (55142344324155).
The spelling of 33021322012122 in words is "thirty-three trillion, twenty-one billion, three hundred twenty-two million, twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •