Base | Representation |
---|---|
bin | 10000000010100000001… |
… | …111010101000111101001 |
3 | 10220100222012202101202022 |
4 | 100002200033111013221 |
5 | 121024301200013001 |
6 | 2202202123114225 |
7 | 142426354266431 |
oct | 20024017250751 |
9 | 3810865671668 |
10 | 1102200001001 |
11 | 395493191340 |
12 | 159744672975 |
13 | 7cc2480a208 |
14 | 3b4bd7452c1 |
15 | 1da0dbbd11b |
hex | 100a03d51e9 |
1102200001001 has 8 divisors (see below), whose sum is σ = 1202508293184. Its totient is φ = 1001909757520.
The previous prime is 1102200000959. The next prime is 1102200001027. The reversal of 1102200001001 is 1001000022011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102200001001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1102200001001.
It is not an unprimeable number, because it can be changed into a prime (1102200001031) 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, 4384325 + ... + 4628898.
It is an arithmetic number, because the mean of its divisors is an integer number (150313536648).
Almost surely, 21102200001001 is an apocalyptic number.
1102200001001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1102200001001 is a deficient number, since it is larger than the sum of its proper divisors (100308292183).
1102200001001 is a wasteful number, since it uses less digits than its factorization.
1102200001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9024351.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1102200001001 its reverse (1001000022011), we get a palindrome (2103200023012).
The spelling of 1102200001001 in words is "one trillion, one hundred two billion, two hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •