Base | Representation |
---|---|
bin | 1111000001010011001101… |
… | …01111000000000100001110 |
3 | 11022221122021000211220100110 |
4 | 13200221212233000010032 |
5 | 13312130441124301220 |
6 | 154125441020340450 |
7 | 6646224511331301 |
oct | 740514657000416 |
9 | 138848230756313 |
10 | 33030022103310 |
11 | a584a54428361 |
12 | 38555336a4726 |
13 | 1557943aa2b0b |
14 | 822939602b38 |
15 | 3c42c0060be0 |
hex | 1e0a66bc010e |
33030022103310 has 32 divisors (see below), whose sum is σ = 80958692477952. Its totient is φ = 8620601513120.
The previous prime is 33030022103279. The next prime is 33030022103321. The reversal of 33030022103310 is 1330122003033.
It is a super-2 number, since 2×330300221033102 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 11712772386 + ... + 11712775205.
It is an arithmetic number, because the mean of its divisors is an integer number (2529959139936).
Almost surely, 233030022103310 is an apocalyptic number.
33030022103310 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
33030022103310 is an abundant number, since it is smaller than the sum of its proper divisors (47928670374642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33030022103310 is a wasteful number, since it uses less digits than its factorization.
33030022103310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23425547648.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 33030022103310 its reverse (1330122003033), we get a palindrome (34360144106343).
The spelling of 33030022103310 in words is "thirty-three trillion, thirty billion, twenty-two million, one hundred three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •