Base | Representation |
---|---|
bin | 11111000000111101… |
… | …001010011011000110 |
3 | 10011221212122102000100 |
4 | 133000331022123012 |
5 | 1021200304430042 |
6 | 23144310024530 |
7 | 2256153404352 |
oct | 370075123306 |
9 | 104855572010 |
10 | 33302030022 |
11 | 1313a145068 |
12 | 6554948146 |
13 | 31a9508411 |
14 | 187cbd2462 |
15 | ced97d24c |
hex | 7c0f4a6c6 |
33302030022 has 12 divisors (see below), whose sum is σ = 72154398420. Its totient is φ = 11100676668.
The previous prime is 33302029973. The next prime is 33302030053. The reversal of 33302030022 is 22003020333.
It is a super-2 number, since 2×333020300222 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1850112779 = 33302030022 / (3 + 3 + 3 + 0 + 2 + 0 + 3 + 0 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 33302029977 and 33302030004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 925056372 + ... + 925056407.
It is an arithmetic number, because the mean of its divisors is an integer number (6012866535).
Almost surely, 233302030022 is an apocalyptic number.
33302030022 is an abundant number, since it is smaller than the sum of its proper divisors (38852368398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33302030022 is a wasteful number, since it uses less digits than its factorization.
33302030022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1850112787 (or 1850112784 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 18.
Adding to 33302030022 its reverse (22003020333), we get a palindrome (55305050355).
The spelling of 33302030022 in words is "thirty-three billion, three hundred two million, thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •