Base | Representation |
---|---|
bin | 1010000110001010100001… |
… | …1110101111000011011001 |
3 | 1110022020200022121012121221 |
4 | 2201202220132233003121 |
5 | 2423334343130402301 |
6 | 35335423354132041 |
7 | 2224010451101044 |
oct | 241425036570331 |
9 | 43266608535557 |
10 | 11101022122201 |
11 | 359aa0a648600 |
12 | 12b3551a21021 |
13 | 626a8b91801b |
14 | 2a5414261c5b |
15 | 143b6a4e4da1 |
hex | a18a87af0d9 |
11101022122201 has 12 divisors (see below), whose sum is σ = 12327743247316. Its totient is φ = 9987798712320.
The previous prime is 11101022122189. The next prime is 11101022122241. The reversal of 11101022122201 is 10222122010111.
It can be written as a sum of positive squares in 2 ways, for example, as 4901176099600 + 6199846022601 = 2213860^2 + 2489949^2 .
It is not a de Polignac number, because 11101022122201 - 213 = 11101022114009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11101022122241) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 472895400 + ... + 472918873.
Almost surely, 211101022122201 is an apocalyptic number.
11101022122201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11101022122201 is a deficient number, since it is larger than the sum of its proper divisors (1226721125115).
11101022122201 is an equidigital number, since it uses as much as digits as its factorization.
11101022122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945814392 (or 945814381 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11101022122201 its reverse (10222122010111), we get a palindrome (21323144132312).
The spelling of 11101022122201 in words is "eleven trillion, one hundred one billion, twenty-two million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •