Base | Representation |
---|---|
bin | 11101011011001000110… |
… | …001101100111000100111 |
3 | 21011022010212120012112000 |
4 | 131123020301230320213 |
5 | 231112030243214343 |
6 | 4144521223500343 |
7 | 266041056531150 |
oct | 35331061547047 |
9 | 7138125505460 |
10 | 2022003101223 |
11 | 70a588045466 |
12 | 287a648b76b3 |
13 | 11889bc30ab1 |
14 | 6dc18bda927 |
15 | 378e4a1eed3 |
hex | 1d6c8c6ce27 |
2022003101223 has 16 divisors (see below), whose sum is σ = 3423497314560. Its totient is φ = 1155430343448.
The previous prime is 2022003101219. The next prime is 2022003101227. The reversal of 2022003101223 is 3221013002202.
It is an interprime number because it is at equal distance from previous prime (2022003101219) and next prime (2022003101227).
It is not a de Polignac number, because 2022003101223 - 22 = 2022003101219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2022003101196 and 2022003101205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022003101227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5349214365 + ... + 5349214742.
It is an arithmetic number, because the mean of its divisors is an integer number (213968582160).
Almost surely, 22022003101223 is an apocalyptic number.
2022003101223 is a deficient number, since it is larger than the sum of its proper divisors (1401494213337).
2022003101223 is a wasteful number, since it uses less digits than its factorization.
2022003101223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10698429123 (or 10698429117 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 2022003101223 its reverse (3221013002202), we get a palindrome (5243016103425).
The spelling of 2022003101223 in words is "two trillion, twenty-two billion, three million, one hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •