Base | Representation |
---|---|
bin | 111000111101110011… |
… | …1110110110100101111 |
3 | 102200202121100220012211 |
4 | 1301323213312310233 |
5 | 4001014240130111 |
6 | 132110555311251 |
7 | 11560346306530 |
oct | 1617347666457 |
9 | 380677326184 |
10 | 122333130031 |
11 | 47976954262 |
12 | 1b86114b527 |
13 | b6c768c098 |
14 | 5cc715a687 |
15 | 32aec1d521 |
hex | 1c7b9f6d2f |
122333130031 has 8 divisors (see below), whose sum is σ = 144319268864. Its totient is φ = 101474485560.
The previous prime is 122333130019. The next prime is 122333130077. The reversal of 122333130031 is 130031333221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122333130031 - 25 = 122333129999 is a prime.
It is a super-2 number, since 2×1223331300312 (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 = 122333129984 and 122333130011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122333130631) 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, 281873355 + ... + 281873788.
It is an arithmetic number, because the mean of its divisors is an integer number (18039908608).
Almost surely, 2122333130031 is an apocalyptic number.
122333130031 is a deficient number, since it is larger than the sum of its proper divisors (21986138833).
122333130031 is an equidigital number, since it uses as much as digits as its factorization.
122333130031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563747181.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 122333130031 its reverse (130031333221), we get a palindrome (252364463252).
The spelling of 122333130031 in words is "one hundred twenty-two billion, three hundred thirty-three million, one hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •