Base | Representation |
---|---|
bin | 1110100101001… |
… | …11110001101111 |
3 | 22112011121021121 |
4 | 13102213301233 |
5 | 222303301111 |
6 | 20045441411 |
7 | 3013501666 |
oct | 722476157 |
9 | 275147247 |
10 | 122322031 |
11 | 63058397 |
12 | 34b70267 |
13 | 1c45ab00 |
14 | 12361ddd |
15 | ab13871 |
hex | 74a7c6f |
122322031 has 6 divisors (see below), whose sum is σ = 132455400. Its totient is φ = 112912488.
The previous prime is 122322017. The next prime is 122322041. The reversal of 122322031 is 130223221.
It is not a de Polignac number, because 122322031 - 223 = 113933423 is a prime.
It is a super-2 number, since 2×1223220312 = 29925358535929922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122321996 and 122322014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122322041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 361731 + ... + 362068.
It is an arithmetic number, because the mean of its divisors is an integer number (22075900).
Almost surely, 2122322031 is an apocalyptic number.
122322031 is a deficient number, since it is larger than the sum of its proper divisors (10133369).
122322031 is an equidigital number, since it uses as much as digits as its factorization.
122322031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 723825 (or 723812 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 122322031 is about 11059.9290684886. The cubic root of 122322031 is about 496.4035680443.
Adding to 122322031 its reverse (130223221), we get a palindrome (252545252).
The spelling of 122322031 in words is "one hundred twenty-two million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •