Base | Representation |
---|---|
bin | 10000010100111101100… |
… | …111011001001000101001 |
3 | 10222021010111221212202210 |
4 | 100110331213121020221 |
5 | 121340344132413001 |
6 | 2215240550515333 |
7 | 144030464230200 |
oct | 20247547311051 |
9 | 3867114855683 |
10 | 1122020201001 |
11 | 3a2934174a17 |
12 | 161556365b49 |
13 | 81a62b80ccb |
14 | 3c43dbc6237 |
15 | 1e2bdc6edd6 |
hex | 1053d9d9229 |
1122020201001 has 24 divisors (see below), whose sum is σ = 1757506711104. Its totient is φ = 634806328800.
The previous prime is 1122020200993. The next prime is 1122020201009. The reversal of 1122020201001 is 1001020202211.
It is an interprime number because it is at equal distance from previous prime (1122020200993) and next prime (1122020201009).
It is not a de Polignac number, because 1122020201001 - 23 = 1122020200993 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1122020201009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37771245 + ... + 37800938.
It is an arithmetic number, because the mean of its divisors is an integer number (73229446296).
Almost surely, 21122020201001 is an apocalyptic number.
It is an amenable number.
1122020201001 is a deficient number, since it is larger than the sum of its proper divisors (635486510103).
1122020201001 is a wasteful number, since it uses less digits than its factorization.
1122020201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75572301 (or 75572294 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1122020201001 its reverse (1001020202211), we get a palindrome (2123040403212).
The spelling of 1122020201001 in words is "one trillion, one hundred twenty-two billion, twenty million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •