Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …100101010010001100011 |
3 | 10220011211121110220012120 |
4 | 100000221230222101203 |
5 | 121011213031413443 |
6 | 2201232520155323 |
7 | 142326154623156 |
oct | 20005154522143 |
9 | 3804747426176 |
10 | 1100211201123 |
11 | 3946625a4581 |
12 | 15928a608b43 |
13 | 7c998784a58 |
14 | 3b371563c9d |
15 | 1d9442be083 |
hex | 10029b2a463 |
1100211201123 has 8 divisors (see below), whose sum is σ = 1469517356736. Its totient is φ = 732189589800.
The previous prime is 1100211201113. The next prime is 1100211201127. The reversal of 1100211201123 is 3211021120011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100211201123 - 28 = 1100211200867 is a prime.
It is a super-2 number, since 2×11002112011232 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1100211201127) 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, 321134073 + ... + 321137498.
It is an arithmetic number, because the mean of its divisors is an integer number (183689669592).
Almost surely, 21100211201123 is an apocalyptic number.
1100211201123 is a deficient number, since it is larger than the sum of its proper divisors (369306155613).
1100211201123 is an equidigital number, since it uses as much as digits as its factorization.
1100211201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642272145.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1100211201123 its reverse (3211021120011), we get a palindrome (4311232321134).
The spelling of 1100211201123 in words is "one trillion, one hundred billion, two hundred eleven million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •