Base | Representation |
---|---|
bin | 11101001000101100101… |
… | …01110101000100100000 |
3 | 10112201000112102001011202 |
4 | 32210112111311010200 |
5 | 112400224130413440 |
6 | 2043522222300332 |
7 | 132220150210250 |
oct | 16442625650440 |
9 | 3481015361152 |
10 | 1001102201120 |
11 | 356624103a0a |
12 | 14202b1276a8 |
13 | 7353273a358 |
14 | 3664c999960 |
15 | 1b0933d4615 |
hex | e916575120 |
1001102201120 has 48 divisors (see below), whose sum is σ = 2702975946048. Its totient is φ = 343235040000.
The previous prime is 1001102201093. The next prime is 1001102201129. The reversal of 1001102201120 is 211022011001.
It is not an unprimeable number, because it can be changed into a prime (1001102201129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 446919506 + ... + 446921745.
It is an arithmetic number, because the mean of its divisors is an integer number (56311998876).
Almost surely, 21001102201120 is an apocalyptic number.
1001102201120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001102201120 is an abundant number, since it is smaller than the sum of its proper divisors (1701873744928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001102201120 is an equidigital number, since it uses as much as digits as its factorization.
1001102201120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893841273 (or 893841265 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1001102201120 its reverse (211022011001), we get a palindrome (1212124212121).
The spelling of 1001102201120 in words is "one trillion, one billion, one hundred two million, two hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •