Base | Representation |
---|---|
bin | 1111000110110110111111… |
… | …01100011000101111100001 |
3 | 11100121220021200221112101112 |
4 | 13203123133230120233201 |
5 | 13323243132141201423 |
6 | 154353310331113105 |
7 | 6666066044005163 |
oct | 743333754305741 |
9 | 140556250845345 |
10 | 33221030022113 |
11 | a648a6141689a |
12 | 388655b8a2795 |
13 | 156c96418518b |
14 | 82bc99370933 |
15 | 3c924dd6ea78 |
hex | 1e36dfb18be1 |
33221030022113 has 8 divisors (see below), whose sum is σ = 33272180787456. Its totient is φ = 33169889970000.
The previous prime is 33221030022097. The next prime is 33221030022127. The reversal of 33221030022113 is 31122003012233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 33221030022113 - 24 = 33221030022097 is a prime.
It is a super-2 number, since 2×332210300221132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (33221030022413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3539438 + ... + 8886488.
It is an arithmetic number, because the mean of its divisors is an integer number (4159022598432).
Almost surely, 233221030022113 is an apocalyptic number.
It is an amenable number.
33221030022113 is a deficient number, since it is larger than the sum of its proper divisors (51150765343).
33221030022113 is an equidigital number, since it uses as much as digits as its factorization.
33221030022113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5356615.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 33221030022113 its reverse (31122003012233), we get a palindrome (64343033034346).
The spelling of 33221030022113 in words is "thirty-three trillion, two hundred twenty-one billion, thirty million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •