Base | Representation |
---|---|
bin | 111000111101001111… |
… | …1101111000110011111 |
3 | 102200201021210101001121 |
4 | 1301322133233012133 |
5 | 4000444420132111 |
6 | 132105042151411 |
7 | 11560026515146 |
oct | 1617237570637 |
9 | 380637711047 |
10 | 122314224031 |
11 | 4796721096a |
12 | 1b856952567 |
13 | b6c379c8bc |
14 | 5cc483875d |
15 | 32ad236871 |
hex | 1c7a7ef19f |
122314224031 has 8 divisors (see below), whose sum is σ = 122547708000. Its totient is φ = 122080838880.
The previous prime is 122314224029. The next prime is 122314224047. The reversal of 122314224031 is 130422413221.
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 122314224031 - 21 = 122314224029 is a prime.
It is a super-2 number, since 2×1223142240312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122314223987 and 122314224005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122314227031) 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, 2745885 + ... + 2790073.
It is an arithmetic number, because the mean of its divisors is an integer number (15318463500).
Almost surely, 2122314224031 is an apocalyptic number.
122314224031 is a deficient number, since it is larger than the sum of its proper divisors (233483969).
122314224031 is an equidigital number, since it uses as much as digits as its factorization.
122314224031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49409.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 122314224031 its reverse (130422413221), we get a palindrome (252736637252).
The spelling of 122314224031 in words is "one hundred twenty-two billion, three hundred fourteen million, two hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •