Base | Representation |
---|---|
bin | 10000000000101010010… |
… | …010000111100001000111 |
3 | 10220011212021221202111020 |
4 | 100000222102013201013 |
5 | 121011223040121411 |
6 | 2201233510442223 |
7 | 142326334240254 |
oct | 20005222074107 |
9 | 3804767852436 |
10 | 1100221020231 |
11 | 3946680a0843 |
12 | 159291963373 |
13 | 7c99a812188 |
14 | 3b37299c42b |
15 | 1d9450ad606 |
hex | 1002a487847 |
1100221020231 has 8 divisors (see below), whose sum is σ = 1553253205104. Its totient is φ = 690334757760.
The previous prime is 1100221020229. The next prime is 1100221020247. The reversal of 1100221020231 is 1320201220011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100221020231 - 21 = 1100221020229 is a prime.
It is a super-2 number, since 2×11002210202312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1100221020231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100221020221) 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, 10786480540 + ... + 10786480641.
It is an arithmetic number, because the mean of its divisors is an integer number (194156650638).
Almost surely, 21100221020231 is an apocalyptic number.
1100221020231 is a deficient number, since it is larger than the sum of its proper divisors (453032184873).
1100221020231 is a wasteful number, since it uses less digits than its factorization.
1100221020231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21572961201.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1100221020231 its reverse (1320201220011), we get a palindrome (2420422240242).
The spelling of 1100221020231 in words is "one trillion, one hundred billion, two hundred twenty-one million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •