Base | Representation |
---|---|
bin | 10000010011010010011… |
… | …011110101101101101111 |
3 | 10222002111012100022202100 |
4 | 100103102123311231233 |
5 | 121323203313311343 |
6 | 2214342313230143 |
7 | 143635100656401 |
oct | 20232233655557 |
9 | 3862435308670 |
10 | 1120222010223 |
11 | 3a20a1136638 |
12 | 161134102353 |
13 | 818374755b4 |
14 | 3c30d060b71 |
15 | 1e215e729d3 |
hex | 104d26f5b6f |
1120222010223 has 6 divisors (see below), whose sum is σ = 1618098459224. Its totient is φ = 746814673476.
The previous prime is 1120222010203. The next prime is 1120222010231. The reversal of 1120222010223 is 3220102220211.
1120222010223 is a `hidden beast` number, since 11 + 202 + 220 + 10 + 223 = 666.
It is not a de Polignac number, because 1120222010223 - 217 = 1120221879151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120222010196 and 1120222010205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120222010203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 62234556115 + ... + 62234556132.
Almost surely, 21120222010223 is an apocalyptic number.
1120222010223 is a deficient number, since it is larger than the sum of its proper divisors (497876449001).
1120222010223 is a wasteful number, since it uses less digits than its factorization.
1120222010223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124469112253 (or 124469112250 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 1120222010223 its reverse (3220102220211), we get a palindrome (4340324230434).
The spelling of 1120222010223 in words is "one trillion, one hundred twenty billion, two hundred twenty-two million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •