Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …010101011001101111001 |
3 | 10220021102021211001212212 |
4 | 100001211102223031321 |
5 | 121020240010202301 |
6 | 2201520033544505 |
7 | 142363015150343 |
oct | 20014522531571 |
9 | 3807367731785 |
10 | 1101211022201 |
11 | 395025a05994 |
12 | 159509415135 |
13 | 7cac795b664 |
14 | 3b428266293 |
15 | 1d9a1e674bb |
hex | 100654ab379 |
1101211022201 has 8 divisors (see below), whose sum is σ = 1206194629320. Its totient is φ = 1000694802688.
The previous prime is 1101211022189. The next prime is 1101211022227. The reversal of 1101211022201 is 1022201121011.
It can be written as a sum of positive squares in 4 ways, for example, as 127199935801 + 974011086400 = 356651^2 + 986920^2 .
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-1101211022201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101211021201) 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, 1116846386 + ... + 1116847371.
It is an arithmetic number, because the mean of its divisors is an integer number (150774328665).
Almost surely, 21101211022201 is an apocalyptic number.
It is an amenable number.
1101211022201 is a deficient number, since it is larger than the sum of its proper divisors (104983607119).
1101211022201 is a wasteful number, since it uses less digits than its factorization.
1101211022201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2233693803.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1101211022201 its reverse (1022201121011), we get a palindrome (2123412143212).
The spelling of 1101211022201 in words is "one trillion, one hundred one billion, two hundred eleven million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •