Base | Representation |
---|---|
bin | 1110100111011… |
… | …01100000001111 |
3 | 22112201010001101 |
4 | 13103231200033 |
5 | 222341421011 |
6 | 20055523531 |
7 | 3016101436 |
oct | 723554017 |
9 | 275633041 |
10 | 122607631 |
11 | 63232a23 |
12 | 350895a7 |
13 | 1c52aac3 |
14 | 123d811d |
15 | ab6d2c1 |
hex | 74ed80f |
122607631 has 8 divisors (see below), whose sum is σ = 125420544. Its totient is φ = 119803320.
The previous prime is 122607623. The next prime is 122607643. The reversal of 122607631 is 136706221.
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 122607631 - 23 = 122607623 is a prime.
It is a super-2 number, since 2×1226076312 = 30065262358864322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122607631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122607601) 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, 33166 + ... + 36676.
It is an arithmetic number, because the mean of its divisors is an integer number (15677568).
Almost surely, 2122607631 is an apocalyptic number.
122607631 is a deficient number, since it is larger than the sum of its proper divisors (2812913).
122607631 is an equidigital number, since it uses as much as digits as its factorization.
122607631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4301.
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 122607631 is about 11072.8330159901. The cubic root of 122607631 is about 496.7896055190.
It can be divided in two parts, 12260 and 7631, that added together give a palindrome (19891).
The spelling of 122607631 in words is "one hundred twenty-two million, six hundred seven thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •