Base | Representation |
---|---|
bin | 111000110111100011… |
… | …0010100100001111101 |
3 | 102200012221222210202201 |
4 | 1301233012110201331 |
5 | 4000101442342341 |
6 | 132034051551501 |
7 | 11552215322260 |
oct | 1615706244175 |
9 | 380187883681 |
10 | 122123012221 |
11 | 47879290681 |
12 | 1b8028bb591 |
13 | b692ca1712 |
14 | 5ca72a2cd7 |
15 | 329b566331 |
hex | 1c6f19487d |
122123012221 has 8 divisors (see below), whose sum is σ = 146914902080. Its totient is φ = 99167558688.
The previous prime is 122123012203. The next prime is 122123012243. The reversal of 122123012221 is 122210321221.
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 122123012221 - 29 = 122123011709 is a prime.
It is a super-2 number, since 2×1221230122212 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122123012281) 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, 459108936 + ... + 459109201.
It is an arithmetic number, because the mean of its divisors is an integer number (18364362760).
Almost surely, 2122123012221 is an apocalyptic number.
It is an amenable number.
122123012221 is a deficient number, since it is larger than the sum of its proper divisors (24791889859).
122123012221 is an equidigital number, since it uses as much as digits as its factorization.
122123012221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 918218163.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 122123012221 its reverse (122210321221), we get a palindrome (244333333442).
The spelling of 122123012221 in words is "one hundred twenty-two billion, one hundred twenty-three million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •