Base | Representation |
---|---|
bin | 1010000111011000110000… |
… | …1010111010100101101001 |
3 | 1110101020212211120120201211 |
4 | 2201312030022322211221 |
5 | 2424210400113013001 |
6 | 35353215242313121 |
7 | 2225353034112352 |
oct | 241661412724551 |
9 | 43336784516654 |
10 | 11122022001001 |
11 | 35a890651833a |
12 | 12b76327b87a1 |
13 | 628a574b9902 |
14 | 2a6447262d29 |
15 | 144498e1b351 |
hex | a1d8c2ba969 |
11122022001001 has 8 divisors (see below), whose sum is σ = 11331921353544. Its totient is φ = 10912124496000.
The previous prime is 11122022000977. The next prime is 11122022001037. The reversal of 11122022001001 is 10010022022111.
It can be written as a sum of positive squares in 4 ways, for example, as 1548969419776 + 9573052581225 = 1244576^2 + 3094035^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11122022001001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11122022001061) 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, 21098695 + ... + 21619411.
It is an arithmetic number, because the mean of its divisors is an integer number (1416490169193).
Almost surely, 211122022001001 is an apocalyptic number.
It is an amenable number.
11122022001001 is a deficient number, since it is larger than the sum of its proper divisors (209899352543).
11122022001001 is an equidigital number, since it uses as much as digits as its factorization.
11122022001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 923771.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11122022001001 its reverse (10010022022111), we get a palindrome (21132044023112).
The spelling of 11122022001001 in words is "eleven trillion, one hundred twenty-two billion, twenty-two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •