Base | Representation |
---|---|
bin | 11101010010000111110… |
… | …000000010000110101111 |
3 | 21010101011012020222122111 |
4 | 131102013300002012233 |
5 | 230432213441211343 |
6 | 4140240440424451 |
7 | 265246135364143 |
oct | 35220760020657 |
9 | 7111135228574 |
10 | 2012322210223 |
11 | 70646a4767a6 |
12 | 286002778127 |
13 | 1179b83a2120 |
14 | 6d57b1c3223 |
15 | 37529b97c9d |
hex | 1d487c021af |
2012322210223 has 16 divisors (see below), whose sum is σ = 2295349963200. Its totient is φ = 1747685592576.
The previous prime is 2012322210221. The next prime is 2012322210229. The reversal of 2012322210223 is 3220122232102.
It is a cyclic number.
It is not a de Polignac number, because 2012322210223 - 21 = 2012322210221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2012322210194 and 2012322210203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012322210221) 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 15 ways as a sum of consecutive naturals, for example, 827923 + ... + 2170276.
It is an arithmetic number, because the mean of its divisors is an integer number (143459372700).
Almost surely, 22012322210223 is an apocalyptic number.
2012322210223 is a deficient number, since it is larger than the sum of its proper divisors (283027752977).
2012322210223 is a wasteful number, since it uses less digits than its factorization.
2012322210223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3001266.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 2012322210223 its reverse (3220122232102), we get a palindrome (5232444442325).
The spelling of 2012322210223 in words is "two trillion, twelve billion, three hundred twenty-two million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •