Base | Representation |
---|---|
bin | 111000110111001100… |
… | …0111101011100111101 |
3 | 102200012010121200101000 |
4 | 1301232120331130331 |
5 | 4000040421334323 |
6 | 132032545040513 |
7 | 11552012255514 |
oct | 1615630753475 |
9 | 380163550330 |
10 | 122111121213 |
11 | 478725a97a4 |
12 | 1b7ba926139 |
13 | b69069a213 |
14 | 5ca588967b |
15 | 329a4b7e43 |
hex | 1c6e63d73d |
122111121213 has 8 divisors (see below), whose sum is σ = 180905364800. Its totient is φ = 81407414124.
The previous prime is 122111121211. The next prime is 122111121217. The reversal of 122111121213 is 312121111221.
It is a happy number.
It is not a de Polignac number, because 122111121213 - 21 = 122111121211 is a prime.
It is a super-2 number, since 2×1221111212132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122111121211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2261317033 + ... + 2261317086.
It is an arithmetic number, because the mean of its divisors is an integer number (22613170600).
Almost surely, 2122111121213 is an apocalyptic number.
It is an amenable number.
122111121213 is a deficient number, since it is larger than the sum of its proper divisors (58794243587).
122111121213 is an equidigital number, since it uses as much as digits as its factorization.
122111121213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4522634128 (or 4522634122 counting only the distinct ones).
The product of its digits is 48, while the sum is 18.
Adding to 122111121213 its reverse (312121111221), we get a palindrome (434232232434).
The spelling of 122111121213 in words is "one hundred twenty-two billion, one hundred eleven million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •