Base | Representation |
---|---|
bin | 11110110110101101… |
… | …110001011011001111 |
3 | 10011111220100201111211 |
4 | 132312231301123033 |
5 | 1020322314121221 |
6 | 23115251355251 |
7 | 2251666152223 |
oct | 366655613317 |
9 | 104456321454 |
10 | 33130223311 |
11 | 13061169149 |
12 | 65072b2b27 |
13 | 317ca42943 |
14 | 186406c783 |
15 | cdd8426e1 |
hex | 7b6b716cf |
33130223311 has 16 divisors (see below), whose sum is σ = 34657072128. Its totient is φ = 31633041600.
The previous prime is 33130223303. The next prime is 33130223323. The reversal of 33130223311 is 11332203133.
It is a cyclic number.
It is not a de Polignac number, because 33130223311 - 23 = 33130223303 is a prime.
It is a super-2 number, since 2×331302233112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33130223011) 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 15 ways as a sum of consecutive naturals, for example, 2016771 + ... + 2033131.
It is an arithmetic number, because the mean of its divisors is an integer number (2166067008).
Almost surely, 233130223311 is an apocalyptic number.
33130223311 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
33130223311 is a deficient number, since it is larger than the sum of its proper divisors (1526848817).
33130223311 is a wasteful number, since it uses less digits than its factorization.
33130223311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17262.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 33130223311 its reverse (11332203133), we get a palindrome (44462426444).
The spelling of 33130223311 in words is "thirty-three billion, one hundred thirty million, two hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •