Base | Representation |
---|---|
bin | 1010000110101100000000… |
… | …1101100010001110111110 |
3 | 1110100002212201020220212010 |
4 | 2201223000031202032332 |
5 | 2424011300102413042 |
6 | 35343511311552050 |
7 | 2224446260361345 |
oct | 241530015421676 |
9 | 43302781226763 |
10 | 11110010201022 |
11 | 35a3802137217 |
12 | 12b523bb2b626 |
13 | 627891a83165 |
14 | 2a5a27c52b5c |
15 | 143ee461959c |
hex | a1ac03623be |
11110010201022 has 8 divisors (see below), whose sum is σ = 22220020402056. Its totient is φ = 3703336733672.
The previous prime is 11110010200987. The next prime is 11110010201023. The reversal of 11110010201022 is 22010201001111.
It is a sphenic number, since it is the product of 3 distinct primes.
11110010201022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11110010200989 and 11110010201007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110010201023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 925834183413 + ... + 925834183424.
It is an arithmetic number, because the mean of its divisors is an integer number (2777502550257).
Almost surely, 211110010201022 is an apocalyptic number.
11110010201022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110010201022 is a wasteful number, since it uses less digits than its factorization.
11110010201022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1851668366842.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11110010201022 its reverse (22010201001111), we get a palindrome (33120211202133).
The spelling of 11110010201022 in words is "eleven trillion, one hundred ten billion, ten million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •