Base | Representation |
---|---|
bin | 10000000001101101101… |
… | …101101110001111101101 |
3 | 10220021210010201021001020 |
4 | 100001231231232033231 |
5 | 121021032144031341 |
6 | 2201542042404353 |
7 | 142366352226153 |
oct | 20015555561755 |
9 | 3807703637036 |
10 | 1101352330221 |
11 | 395098750780 |
12 | 1595488006b9 |
13 | 7cb1b006180 |
14 | 3b43cd2b3d3 |
15 | 1d9ae57b566 |
hex | 1006db6e3ed |
1101352330221 has 32 divisors (see below), whose sum is σ = 1749493831680. Its totient is φ = 607463102400.
The previous prime is 1101352330219. The next prime is 1101352330283. The reversal of 1101352330221 is 1220332531011.
It is a happy number.
It is not a de Polignac number, because 1101352330221 - 21 = 1101352330219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101352330191 and 1101352330200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101352330021) 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, 18048801 + ... + 18109718.
It is an arithmetic number, because the mean of its divisors is an integer number (54671682240).
Almost surely, 21101352330221 is an apocalyptic number.
1101352330221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1101352330221 is a deficient number, since it is larger than the sum of its proper divisors (648141501459).
1101352330221 is a wasteful number, since it uses less digits than its factorization.
1101352330221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36158617.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 1101352330221 its reverse (1220332531011), we get a palindrome (2321684861232).
The spelling of 1101352330221 in words is "one trillion, one hundred one billion, three hundred fifty-two million, three hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •