Base | Representation |
---|---|
bin | 10000000001100101111… |
… | …000101111001101000001 |
3 | 10220021102222120222212000 |
4 | 100001211320233031001 |
5 | 121020300034000001 |
6 | 2201521031454213 |
7 | 142363166025213 |
oct | 20014570571501 |
9 | 3807388528760 |
10 | 1101221000001 |
11 | 395030600401 |
12 | 159510827369 |
13 | 7cac9a43095 |
14 | 3b4297025b3 |
15 | 1d9a2c88a86 |
hex | 10065e2f341 |
1101221000001 has 16 divisors (see below), whose sum is σ = 1662220379520. Its totient is φ = 720295495920.
The previous prime is 1101220999987. The next prime is 1101221000003. The reversal of 1101221000001 is 1000001221011.
It is a happy number.
It is not a de Polignac number, because 1101221000001 - 25 = 1101220999969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1101221000003) 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 15 ways as a sum of consecutive naturals, for example, 384771805 + ... + 384774666.
It is an arithmetic number, because the mean of its divisors is an integer number (103888773720).
Almost surely, 21101221000001 is an apocalyptic number.
It is an amenable number.
1101221000001 is a deficient number, since it is larger than the sum of its proper divisors (560999379519).
1101221000001 is an equidigital number, since it uses as much as digits as its factorization.
1101221000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 769546533 (or 769546527 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1101221000001 its reverse (1000001221011), we get a palindrome (2101222221012).
The spelling of 1101221000001 in words is "one trillion, one hundred one billion, two hundred twenty-one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •