Base | Representation |
---|---|
bin | 110111111000111100… |
… | …0110100011110000111 |
3 | 102110210120011122012022 |
4 | 1233301320310132013 |
5 | 3431301203233111 |
6 | 131045410513355 |
7 | 11446156616204 |
oct | 1576170643607 |
9 | 373716148168 |
10 | 120022321031 |
11 | 469a0520258 |
12 | 1b31729585b |
13 | b419a01092 |
14 | 5b482b6cab |
15 | 31c6e142db |
hex | 1bf1e34787 |
120022321031 has 4 divisors (see below), whose sum is σ = 120546436200. Its totient is φ = 119498205864.
The previous prime is 120022320991. The next prime is 120022321039. The reversal of 120022321031 is 130123220021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130123220021 = 82013 ⋅1586617.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120022321031 is a prime.
It is a super-2 number, since 2×1200223210312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120022321039) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 262057241 + ... + 262057698.
It is an arithmetic number, because the mean of its divisors is an integer number (30136609050).
Almost surely, 2120022321031 is an apocalyptic number.
120022321031 is a deficient number, since it is larger than the sum of its proper divisors (524115169).
120022321031 is an equidigital number, since it uses as much as digits as its factorization.
120022321031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 524115168.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 120022321031 its reverse (130123220021), we get a palindrome (250145541052).
The spelling of 120022321031 in words is "one hundred twenty billion, twenty-two million, three hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •