Base | Representation |
---|---|
bin | 10000001010111000110… |
… | …011101111000000110101 |
3 | 10221020012120212000222022 |
4 | 100022320303233000311 |
5 | 121201220221211041 |
6 | 2210251302042525 |
7 | 143165424164402 |
oct | 20127063570065 |
9 | 3836176760868 |
10 | 1111202132021 |
11 | 3992926a8643 |
12 | 15b437419445 |
13 | 80a2a855467 |
14 | 3bad51532a9 |
15 | 1dd8916b24b |
hex | 102b8cef035 |
1111202132021 has 8 divisors (see below), whose sum is σ = 1138942305600. Its totient is φ = 1083548243232.
The previous prime is 1111202132017. The next prime is 1111202132081. The reversal of 1111202132021 is 1202312021111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1111202132021 - 22 = 1111202132017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111202132081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21545120 + ... + 21596633.
It is an arithmetic number, because the mean of its divisors is an integer number (142367788200).
Almost surely, 21111202132021 is an apocalyptic number.
It is an amenable number.
1111202132021 is a deficient number, since it is larger than the sum of its proper divisors (27740173579).
1111202132021 is an equidigital number, since it uses as much as digits as its factorization.
1111202132021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43142395.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1111202132021 its reverse (1202312021111), we get a palindrome (2313514153132).
The spelling of 1111202132021 in words is "one trillion, one hundred eleven billion, two hundred two million, one hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •