Base | Representation |
---|---|
bin | 10000010011010010011… |
… | …100100110100010011001 |
3 | 10222002111012201111001221 |
4 | 100103102130212202121 |
5 | 121323203341211301 |
6 | 2214342321412041 |
7 | 143635102451413 |
oct | 20232234464231 |
9 | 3862435644057 |
10 | 1120222210201 |
11 | 3a20a1262906 |
12 | 16113419a021 |
13 | 81837515623 |
14 | 3c30d0b39b3 |
15 | 1e215eb1da1 |
hex | 104d2726899 |
1120222210201 has 32 divisors (see below), whose sum is σ = 1220232625920. Its totient is φ = 1025542662144.
The previous prime is 1120222210181. The next prime is 1120222210207. The reversal of 1120222210201 is 1020122220211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1120222210201 - 213 = 1120222202009 is a prime.
It is a super-2 number, since 2×11202222102012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120222210207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42392145 + ... + 42418561.
It is an arithmetic number, because the mean of its divisors is an integer number (38132269560).
Almost surely, 21120222210201 is an apocalyptic number.
It is an amenable number.
1120222210201 is a deficient number, since it is larger than the sum of its proper divisors (100010415719).
1120222210201 is a wasteful number, since it uses less digits than its factorization.
1120222210201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27345.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1120222210201 its reverse (1020122220211), we get a palindrome (2140344430412).
The spelling of 1120222210201 in words is "one trillion, one hundred twenty billion, two hundred twenty-two million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •