Base | Representation |
---|---|
bin | 1111000110111100111001… |
… | …01101000101111100111001 |
3 | 11100122012110200220000222220 |
4 | 13203132130231011330321 |
5 | 13323321130440213423 |
6 | 154354553130234253 |
7 | 6666240450512361 |
oct | 743363455057471 |
9 | 140565420800886 |
10 | 33224201101113 |
11 | a64a339406440 |
12 | 38870a5885989 |
13 | 157004b138b99 |
14 | 82c0ba58b9a1 |
15 | 3c93874589e3 |
hex | 1e379cb45f39 |
33224201101113 has 32 divisors (see below), whose sum is σ = 48997379302272. Its totient is φ = 19856288563200.
The previous prime is 33224201101103. The next prime is 33224201101141. The reversal of 33224201101113 is 31110110242233.
It is not a de Polignac number, because 33224201101113 - 216 = 33224201035577 is a prime.
It is a super-2 number, since 2×332242011011132 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (33224201101103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11458633 + ... + 14062313.
It is an arithmetic number, because the mean of its divisors is an integer number (1531168103196).
Almost surely, 233224201101113 is an apocalyptic number.
33224201101113 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
33224201101113 is a deficient number, since it is larger than the sum of its proper divisors (15773178201159).
33224201101113 is a wasteful number, since it uses less digits than its factorization.
33224201101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2609065.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 33224201101113 its reverse (31110110242233), we get a palindrome (64334311343346).
The spelling of 33224201101113 in words is "thirty-three trillion, two hundred twenty-four billion, two hundred one million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •