Base | Representation |
---|---|
bin | 11011110000110100101001… |
… | …000000000010000001000101 |
3 | 121000022212102010211111212112 |
4 | 123300310221000002001011 |
5 | 112001011014130211401 |
6 | 1111405010035230405 |
7 | 34501413101025131 |
oct | 3360645100020105 |
9 | 530285363744775 |
10 | 122102313132101 |
11 | 359a6333620515 |
12 | 118402b5748405 |
13 | 5319277792ca3 |
14 | 2221ad7c6a3c1 |
15 | e1b2649853bb |
hex | 6f0d29002045 |
122102313132101 has 8 divisors (see below), whose sum is σ = 122556599147520. Its totient is φ = 121648029888112.
The previous prime is 122102313132061. The next prime is 122102313132133. The reversal of 122102313132101 is 101231313201221.
It is a happy number.
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 122102313132101 - 246 = 51733568954437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122102313132901) 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, 142579676 + ... + 143433498.
It is an arithmetic number, because the mean of its divisors is an integer number (15319574893440).
Almost surely, 2122102313132101 is an apocalyptic number.
It is an amenable number.
122102313132101 is a deficient number, since it is larger than the sum of its proper divisors (454286015419).
122102313132101 is an equidigital number, since it uses as much as digits as its factorization.
122102313132101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1385715.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 122102313132101 its reverse (101231313201221), we get a palindrome (223333626333322).
The spelling of 122102313132101 in words is "one hundred twenty-two trillion, one hundred two billion, three hundred thirteen million, one hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •