Base | Representation |
---|---|
bin | 110000001100100011111… |
… | …001010110011101111011 |
3 | 102201121220111202022001201 |
4 | 300030203321112131323 |
5 | 413231010114201021 |
6 | 11013304422155031 |
7 | 461166664453333 |
oct | 60144371263573 |
9 | 12647814668051 |
10 | 3312022022011 |
11 | 10676910a605a |
12 | 455a85582a77 |
13 | 1b0426233bb1 |
14 | b643494a0c3 |
15 | 5b247573591 |
hex | 30323e5677b |
3312022022011 has 8 divisors (see below), whose sum is σ = 3405414768560. Its totient is φ = 3218833414368.
The previous prime is 3312022022009. The next prime is 3312022022107. The reversal of 3312022022011 is 1102202202133.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3312022022011 - 21 = 3312022022009 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3312022022011.
It is not an unprimeable number, because it can be changed into a prime (3312022022611) 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 7 ways as a sum of consecutive naturals, for example, 51001821 + ... + 51066718.
It is an arithmetic number, because the mean of its divisors is an integer number (425676846070).
Almost surely, 23312022022011 is an apocalyptic number.
3312022022011 is a deficient number, since it is larger than the sum of its proper divisors (93392746549).
3312022022011 is a wasteful number, since it uses less digits than its factorization.
3312022022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102069453.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 3312022022011 its reverse (1102202202133), we get a palindrome (4414224224144).
The spelling of 3312022022011 in words is "three trillion, three hundred twelve billion, twenty-two million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •