Base | Representation |
---|---|
bin | 100000010011100011101… |
… | …100110111001011100011 |
3 | 21212020021020112020022020 |
4 | 200103203230313023203 |
5 | 242333101432004443 |
6 | 4415510432112523 |
7 | 316251150544200 |
oct | 40234354671343 |
9 | 7766236466266 |
10 | 2220023313123 |
11 | 786563314550 |
12 | 2ba309395743 |
13 | 131469031605 |
14 | 79641da4ca7 |
15 | 3cb34275583 |
hex | 204e3b372e3 |
2220023313123 has 24 divisors (see below), whose sum is σ = 3756328873920. Its totient is φ = 1153258863120.
The previous prime is 2220023313113. The next prime is 2220023313191. The reversal of 2220023313123 is 3213133200222.
2220023313123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2220023313123 - 26 = 2220023313059 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2220023313093 and 2220023313102.
It is not an unprimeable number, because it can be changed into a prime (2220023313103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 686461993 + ... + 686465226.
It is an arithmetic number, because the mean of its divisors is an integer number (156513703080).
Almost surely, 22220023313123 is an apocalyptic number.
2220023313123 is a deficient number, since it is larger than the sum of its proper divisors (1536305560797).
2220023313123 is a wasteful number, since it uses less digits than its factorization.
2220023313123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1372927247 (or 1372927240 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 2220023313123 its reverse (3213133200222), we get a palindrome (5433156513345).
The spelling of 2220023313123 in words is "two trillion, two hundred twenty billion, twenty-three million, three hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •