Base | Representation |
---|---|
bin | 11101101111111111111… |
… | …01011110010001011011 |
3 | 10121201110222120020002020 |
4 | 32313333331132101123 |
5 | 113221432044212021 |
6 | 2101332022505523 |
7 | 133565051563521 |
oct | 16677775362133 |
9 | 3551428506066 |
10 | 1022201554011 |
11 | 364571146040 |
12 | 1461392952a3 |
13 | 75515aca251 |
14 | 37690c92311 |
15 | 1b8ca9097c6 |
hex | edfff5e45b |
1022201554011 has 8 divisors (see below), whose sum is σ = 1486838624064. Its totient is φ = 619516093320.
The previous prime is 1022201554007. The next prime is 1022201554063. The reversal of 1022201554011 is 1104551022201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1022201554011 - 22 = 1022201554007 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1022201554001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15487902301 + ... + 15487902366.
It is an arithmetic number, because the mean of its divisors is an integer number (185854828008).
Almost surely, 21022201554011 is an apocalyptic number.
1022201554011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1022201554011 is a deficient number, since it is larger than the sum of its proper divisors (464637070053).
1022201554011 is a wasteful number, since it uses less digits than its factorization.
1022201554011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30975804681.
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 1022201554011 its reverse (1104551022201), we get a palindrome (2126752576212).
The spelling of 1022201554011 in words is "one trillion, twenty-two billion, two hundred one million, five hundred fifty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •