Base | Representation |
---|---|
bin | 10000000000011110011… |
… | …000010111010100001001 |
3 | 10220011100101012111122112 |
4 | 100000132120113110021 |
5 | 121010320430044314 |
6 | 2201202014432105 |
7 | 142321361016443 |
oct | 20003630272411 |
9 | 3804311174575 |
10 | 1100021331209 |
11 | 394575400499 |
12 | 159236b02635 |
13 | 7c9683365a8 |
14 | 3b35425b493 |
15 | 1d9327b643e |
hex | 1001e617509 |
1100021331209 has 8 divisors (see below), whose sum is σ = 1110944944200. Its totient is φ = 1089098352000.
The previous prime is 1100021331173. The next prime is 1100021331229. The reversal of 1100021331209 is 9021331200011.
It can be written as a sum of positive squares in 4 ways, for example, as 149172067984 + 950849263225 = 386228^2 + 975115^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1100021331209 is a prime.
It is a super-2 number, since 2×11000213312092 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100021331229) 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, 3824567 + ... + 4102115.
It is an arithmetic number, because the mean of its divisors is an integer number (138868118025).
Almost surely, 21100021331209 is an apocalyptic number.
It is an amenable number.
1100021331209 is a deficient number, since it is larger than the sum of its proper divisors (10923612991).
1100021331209 is a wasteful number, since it uses less digits than its factorization.
1100021331209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316891.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 1100021331209 in words is "one trillion, one hundred billion, twenty-one million, three hundred thirty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •