Base | Representation |
---|---|
bin | 11011101111101000001011… |
… | …111011110001111111110111 |
3 | 121000001000112000012012101000 |
4 | 123233220023323301333313 |
5 | 111443134403100200043 |
6 | 1111303152110134343 |
7 | 34462445554203501 |
oct | 3357501373617767 |
9 | 530030460165330 |
10 | 122020221100023 |
11 | 35974537828804 |
12 | 118284051b13b3 |
13 | 53115c40ccc8c |
14 | 221bb4b31ad71 |
15 | e1905c9c52d3 |
hex | 6efa0bef1ff7 |
122020221100023 has 16 divisors (see below), whose sum is σ = 183734151992800. Its totient is φ = 80013259736640.
The previous prime is 122020221100013. The next prime is 122020221100109. The reversal of 122020221100023 is 320001122020221.
It is not a de Polignac number, because 122020221100023 - 213 = 122020221091831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122020221099969 and 122020221100005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122020221100003) 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, 37043174158 + ... + 37043177451.
It is an arithmetic number, because the mean of its divisors is an integer number (11483384499550).
Almost surely, 2122020221100023 is an apocalyptic number.
122020221100023 is a deficient number, since it is larger than the sum of its proper divisors (61713930892777).
122020221100023 is an equidigital number, since it uses as much as digits as its factorization.
122020221100023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74086351679 (or 74086351673 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 122020221100023 its reverse (320001122020221), we get a palindrome (442021343120244).
The spelling of 122020221100023 in words is "one hundred twenty-two trillion, twenty billion, two hundred twenty-one million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •