Base | Representation |
---|---|
bin | 1010000111011001001000… |
… | …0001100110010100110001 |
3 | 1110101021010200101201121122 |
4 | 2201312102001212110301 |
5 | 2424211100234101001 |
6 | 35353233111432025 |
7 | 2225355336015065 |
oct | 241662201462461 |
9 | 43337120351548 |
10 | 11122120222001 |
11 | 35a8956a04218 |
12 | 12b765b685615 |
13 | 628a71959749 |
14 | 2a645630daa5 |
15 | 1444a286db1b |
hex | a1d92066531 |
11122120222001 has 12 divisors (see below), whose sum is σ = 11165948574300. Its totient is φ = 11078462996928.
The previous prime is 11122120221943. The next prime is 11122120222009. The reversal of 11122120222001 is 10022202122111.
It can be written as a sum of positive squares in 6 ways, for example, as 3406058493601 + 7716061728400 = 1845551^2 + 2777780^2 .
It is not a de Polignac number, because 11122120222001 - 214 = 11122120205617 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11122120222009) 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, 424673615 + ... + 424699803.
It is an arithmetic number, because the mean of its divisors is an integer number (930495714525).
Almost surely, 211122120222001 is an apocalyptic number.
It is an amenable number.
11122120222001 is a deficient number, since it is larger than the sum of its proper divisors (43828352299).
11122120222001 is an frugal number, since it uses more digits than its factorization.
11122120222001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32596 (or 32327 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11122120222001 its reverse (10022202122111), we get a palindrome (21144322344112).
The spelling of 11122120222001 in words is "eleven trillion, one hundred twenty-two billion, one hundred twenty million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •