Base | Representation |
---|---|
bin | 10000000001011001111… |
… | …110101001000101011001 |
3 | 10220020221001200011212111 |
4 | 100001121332221011121 |
5 | 121014342413034314 |
6 | 2201445133512321 |
7 | 142355221651600 |
oct | 20013176510531 |
9 | 3806831604774 |
10 | 1101021221209 |
11 | 394a38859668 |
12 | 1594759426a1 |
13 | 7ca97535690 |
14 | 3b40ad7aa37 |
15 | 1d990474ec4 |
hex | 10059fa9159 |
1101021221209 has 24 divisors (see below), whose sum is σ = 1379941305288. Its totient is φ = 870733463040.
The previous prime is 1101021221191. The next prime is 1101021221219. The reversal of 1101021221209 is 9021221201011.
It can be written as a sum of positive squares in 4 ways, for example, as 49491225 + 1100971729984 = 7035^2 + 1049272^2 .
It is not a de Polignac number, because 1101021221209 - 231 = 1098873737561 is a prime.
It is a super-2 number, since 2×11010212212092 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1101021221209.
It is not an unprimeable number, because it can be changed into a prime (1101021221219) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 976639 + ... + 1776475.
It is an arithmetic number, because the mean of its divisors is an integer number (57497554387).
Almost surely, 21101021221209 is an apocalyptic number.
It is an amenable number.
1101021221209 is a deficient number, since it is larger than the sum of its proper divisors (278920084079).
1101021221209 is a wasteful number, since it uses less digits than its factorization.
1101021221209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 802025 (or 802018 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 1101021221209 in words is "one trillion, one hundred one billion, twenty-one million, two hundred twenty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •