Base | Representation |
---|---|
bin | 11011110010011001001000… |
… | …110000111010001001010101 |
3 | 121000201011221101001120222010 |
4 | 123302121020300322021111 |
5 | 112004243012334033023 |
6 | 1111530333342454433 |
7 | 34512253120115031 |
oct | 3362311060721125 |
9 | 530634841046863 |
10 | 122210220221013 |
11 | 35a38077334541 |
12 | 118591ab594419 |
13 | 53264b34b4862 |
14 | 22270130cb1c1 |
15 | e1de7ce66093 |
hex | 6f2648c3a255 |
122210220221013 has 8 divisors (see below), whose sum is σ = 172532075606208. Its totient is φ = 76680922491584.
The previous prime is 122210220220997. The next prime is 122210220221021. The reversal of 122210220221013 is 310122022012221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122210220221013 - 24 = 122210220220997 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122210220221053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1198139413881 + ... + 1198139413982.
It is an arithmetic number, because the mean of its divisors is an integer number (21566509450776).
Almost surely, 2122210220221013 is an apocalyptic number.
It is an amenable number.
122210220221013 is a deficient number, since it is larger than the sum of its proper divisors (50321855385195).
122210220221013 is a wasteful number, since it uses less digits than its factorization.
122210220221013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2396278827883.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 122210220221013 its reverse (310122022012221), we get a palindrome (432332242233234).
The spelling of 122210220221013 in words is "one hundred twenty-two trillion, two hundred ten billion, two hundred twenty million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •