Base | Representation |
---|---|
bin | 10000000000101010010… |
… | …111000101000111101101 |
3 | 10220011212101101211222210 |
4 | 100000222113011013231 |
5 | 121011223403234013 |
6 | 2201233554401033 |
7 | 142326351266055 |
oct | 20005227050755 |
9 | 3804771354883 |
10 | 1100222321133 |
11 | 3946688aa171 |
12 | 159292290179 |
13 | 7c99ab79340 |
14 | 3b372c1a565 |
15 | 1d945268cc3 |
hex | 1002a5c51ed |
1100222321133 has 64 divisors (see below), whose sum is σ = 1636297850880. Its totient is φ = 653179707648.
The previous prime is 1100222321131. The next prime is 1100222321137. The reversal of 1100222321133 is 3311232220011.
It is not a de Polignac number, because 1100222321133 - 21 = 1100222321131 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100222321131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 104192308 + ... + 104202866.
It is an arithmetic number, because the mean of its divisors is an integer number (25567153920).
Almost surely, 21100222321133 is an apocalyptic number.
1100222321133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1100222321133 is a deficient number, since it is larger than the sum of its proper divisors (536075529747).
1100222321133 is a wasteful number, since it uses less digits than its factorization.
1100222321133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11218.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1100222321133 its reverse (3311232220011), we get a palindrome (4411454541144).
The spelling of 1100222321133 in words is "one trillion, one hundred billion, two hundred twenty-two million, three hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •