Base | Representation |
---|---|
bin | 1111000111001011101000… |
… | …00111100100010101001110 |
3 | 11100122221212220002022121002 |
4 | 13203211310013210111032 |
5 | 13323433330142010110 |
6 | 154402342015540302 |
7 | 6666640445131406 |
oct | 743456407442516 |
9 | 140587786068532 |
10 | 33232110110030 |
11 | a652727885947 |
12 | 388873252a692 |
13 | 1570a0b870c10 |
14 | 82c62ab2b806 |
15 | 3c969b97daa5 |
hex | 1e39741e454e |
33232110110030 has 32 divisors (see below), whose sum is σ = 67220000656704. Its totient is φ = 11736825509376.
The previous prime is 33232110110021. The next prime is 33232110110071. The reversal of 33232110110030 is 3001101123233.
It is a super-2 number, since 2×332321101100302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33232110109984 and 33232110110011.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 5557206059 + ... + 5557212038.
It is an arithmetic number, because the mean of its divisors is an integer number (2100625020522).
Almost surely, 233232110110030 is an apocalyptic number.
33232110110030 is an abundant number, since it is smaller than the sum of its proper divisors (33987890546674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33232110110030 is a wasteful number, since it uses less digits than its factorization.
33232110110030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11114418140.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 33232110110030 its reverse (3001101123233), we get a palindrome (36233211233263).
The spelling of 33232110110030 in words is "thirty-three trillion, two hundred thirty-two billion, one hundred ten million, one hundred ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •