Base | Representation |
---|---|
bin | 111101001001000110… |
… | …1011011000011110001 |
3 | 110112220122220021002221 |
4 | 1322102031123003301 |
5 | 4122401303323441 |
6 | 140152545441041 |
7 | 12325533452101 |
oct | 1722215330361 |
9 | 415818807087 |
10 | 131302011121 |
11 | 50759620386 |
12 | 21544940181 |
13 | c4c6865008 |
14 | 64d8391201 |
15 | 36372ee8d1 |
hex | 1e9235b0f1 |
131302011121 has 8 divisors (see below), whose sum is σ = 140375424384. Its totient is φ = 122378571840.
The previous prime is 131302011109. The next prime is 131302011167. The reversal of 131302011121 is 121110203131.
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 131302011121 - 223 = 131293622513 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131302011095 and 131302011104.
It is not an unprimeable number, because it can be changed into a prime (131302011101) 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 7 ways as a sum of consecutive naturals, for example, 37491685 + ... + 37495186.
It is an arithmetic number, because the mean of its divisors is an integer number (17546928048).
Almost surely, 2131302011121 is an apocalyptic number.
It is an amenable number.
131302011121 is a deficient number, since it is larger than the sum of its proper divisors (9073413263).
131302011121 is a wasteful number, since it uses less digits than its factorization.
131302011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74986991.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 131302011121 its reverse (121110203131), we get a palindrome (252412214252).
The spelling of 131302011121 in words is "one hundred thirty-one billion, three hundred two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •