Base | Representation |
---|---|
bin | 10001100111000000111… |
… | …001111000101101000111 |
3 | 11021200112111102122212112 |
4 | 101213000321320231013 |
5 | 124311312241210434 |
6 | 2323531130411235 |
7 | 153266646032504 |
oct | 21470071705507 |
9 | 4250474378775 |
10 | 1210122210119 |
11 | 4272344923a9 |
12 | 176643590b1b |
13 | 8a1636c4054 |
14 | 427da9c04ab |
15 | 21728688dce |
hex | 119c0e78b47 |
1210122210119 has 2 divisors, whose sum is σ = 1210122210120. Its totient is φ = 1210122210118.
The previous prime is 1210122210109. The next prime is 1210122210173. The reversal of 1210122210119 is 9110122210121.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1210122210119 is a prime.
It is a super-2 number, since 2×12101222101192 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1210122210094 and 1210122210103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210122210109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605061105059 + 605061105060.
It is an arithmetic number, because the mean of its divisors is an integer number (605061105060).
Almost surely, 21210122210119 is an apocalyptic number.
1210122210119 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210122210119 is an equidigital number, since it uses as much as digits as its factorization.
1210122210119 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 23.
It can be divided in two parts, 1210122 and 210119, that added together give a palindrome (1420241).
The spelling of 1210122210119 in words is "one trillion, two hundred ten billion, one hundred twenty-two million, two hundred ten thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •