Base | Representation |
---|---|
bin | 11101001000101100101… |
… | …01110101000010110011 |
3 | 10112201000112102001000201 |
4 | 32210112111311002303 |
5 | 112400224130413021 |
6 | 2043522222300031 |
7 | 132220150210033 |
oct | 16442625650263 |
9 | 3481015361021 |
10 | 1001102201011 |
11 | 356624103920 |
12 | 14202b127617 |
13 | 7353273a2a3 |
14 | 3664c9998c3 |
15 | 1b0933d4591 |
hex | e9165750b3 |
1001102201011 has 8 divisors (see below), whose sum is σ = 1092128583024. Its totient is φ = 910078667520.
The previous prime is 1001102201003. The next prime is 1001102201023. The reversal of 1001102201011 is 1101022011001.
1001102201011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1001102201011 - 23 = 1001102201003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001102202011) 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, 59031 + ... + 1416223.
It is an arithmetic number, because the mean of its divisors is an integer number (136516072878).
Almost surely, 21001102201011 is an apocalyptic number.
1001102201011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1001102201011 is a deficient number, since it is larger than the sum of its proper divisors (91026382013).
1001102201011 is a wasteful number, since it uses less digits than its factorization.
1001102201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1424261.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1001102201011 its reverse (1101022011001), we get a palindrome (2102124212012).
The spelling of 1001102201011 in words is "one trillion, one billion, one hundred two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •