Base | Representation |
---|---|
bin | 110111111100001011… |
… | …1110100110001011111 |
3 | 102111002010212210101121 |
4 | 1233320113310301133 |
5 | 3432012031041111 |
6 | 131104254351411 |
7 | 11451650414140 |
oct | 1577027646137 |
9 | 374063783347 |
10 | 120131112031 |
11 | 46a46976577 |
12 | 1b3477bb567 |
13 | b436402058 |
14 | 5b58915ac7 |
15 | 31d1753871 |
hex | 1bf85f4c5f |
120131112031 has 8 divisors (see below), whose sum is σ = 142026930720. Its totient is φ = 99418851168.
The previous prime is 120131111977. The next prime is 120131112137. The reversal of 120131112031 is 130211131021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120131112031 - 211 = 120131109983 is a prime.
It is a super-2 number, since 2×1201311120312 (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 = 120131111996 and 120131112014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120131112631) 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, 295889236 + ... + 295889641.
It is an arithmetic number, because the mean of its divisors is an integer number (17753366340).
Almost surely, 2120131112031 is an apocalyptic number.
120131112031 is a deficient number, since it is larger than the sum of its proper divisors (21895818689).
120131112031 is an equidigital number, since it uses as much as digits as its factorization.
120131112031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 591778913.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 120131112031 its reverse (130211131021), we get a palindrome (250342243052).
The spelling of 120131112031 in words is "one hundred twenty billion, one hundred thirty-one million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •