Base | Representation |
---|---|
bin | 111000110100110100… |
… | …0001011000011110111 |
3 | 102122222120021102200002 |
4 | 1301221220023003313 |
5 | 3444404443114111 |
6 | 132021012341515 |
7 | 11550022165304 |
oct | 1615150130367 |
9 | 378876242602 |
10 | 122031223031 |
11 | 47831498043 |
12 | 1b79801489b |
13 | b679c742a3 |
14 | 5c9900c0ab |
15 | 329348463b |
hex | 1c69a0b0f7 |
122031223031 has 32 divisors (see below), whose sum is σ = 133441067520. Its totient is φ = 111195504000.
The previous prime is 122031223021. The next prime is 122031223049. The reversal of 122031223031 is 130322130221.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122031223031 is a prime.
It is a super-2 number, since 2×1220312230312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122031222994 and 122031223012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122031223001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73203260 + ... + 73204926.
It is an arithmetic number, because the mean of its divisors is an integer number (4170033360).
Almost surely, 2122031223031 is an apocalyptic number.
122031223031 is a deficient number, since it is larger than the sum of its proper divisors (11409844489).
122031223031 is a wasteful number, since it uses less digits than its factorization.
122031223031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2855.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 122031223031 its reverse (130322130221), we get a palindrome (252353353252).
The spelling of 122031223031 in words is "one hundred twenty-two billion, thirty-one million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •