Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …110111011110000100010 |
3 | 10220011210220212102212120 |
4 | 100000221012323300202 |
5 | 121011203013430031 |
6 | 2201231524205110 |
7 | 142326004562601 |
oct | 20005106736042 |
9 | 3804726772776 |
10 | 1100201311266 |
11 | 394657a5a142 |
12 | 159287239796 |
13 | 7c996701375 |
14 | 3b37010ba38 |
15 | 1d9434b8a96 |
hex | 100291bbc22 |
1100201311266 has 8 divisors (see below), whose sum is σ = 2200402622544. Its totient is φ = 366733770420.
The previous prime is 1100201311259. The next prime is 1100201311267. The reversal of 1100201311266 is 6621131020011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1100201311266 is an admirable number.
It is a super-2 number, since 2×11002013112662 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1100201311267) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91683442600 + ... + 91683442611.
It is an arithmetic number, because the mean of its divisors is an integer number (275050327818).
Almost surely, 21100201311266 is an apocalyptic number.
1100201311266 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100201311266 is a wasteful number, since it uses less digits than its factorization.
1100201311266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183366885216.
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 1100201311266 its reverse (6621131020011), we get a palindrome (7721332331277).
The spelling of 1100201311266 in words is "one trillion, one hundred billion, two hundred one million, three hundred eleven thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •