Base | Representation |
---|---|
bin | 1000110000111001100… |
… | …00101010110101011011 |
3 | 1001210021021122201101101 |
4 | 10120130300222311123 |
5 | 14413203314344011 |
6 | 350200505532231 |
7 | 30520200506002 |
oct | 4303460526533 |
9 | 1053237581341 |
10 | 301130231131 |
11 | 10678818a714 |
12 | 4a43baa4077 |
13 | 22520035822 |
14 | 108092adc39 |
15 | 7c76a172c1 |
hex | 461cc2ad5b |
301130231131 has 16 divisors (see below), whose sum is σ = 308792839680. Its totient is φ = 293571210240.
The previous prime is 301130231123. The next prime is 301130231159. The reversal of 301130231131 is 131132031103.
It is a cyclic number.
It is not a de Polignac number, because 301130231131 - 23 = 301130231123 is a prime.
It is a super-2 number, since 2×3011302311312 (a number of 24 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 = 301130231099 and 301130231108.
It is not an unprimeable number, because it can be changed into a prime (301130231191) 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 15 ways as a sum of consecutive naturals, for example, 4964635 + ... + 5024923.
It is an arithmetic number, because the mean of its divisors is an integer number (19299552480).
Almost surely, 2301130231131 is an apocalyptic number.
301130231131 is a deficient number, since it is larger than the sum of its proper divisors (7662608549).
301130231131 is a wasteful number, since it uses less digits than its factorization.
301130231131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61146.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 301130231131 its reverse (131132031103), we get a palindrome (432262262234).
The spelling of 301130231131 in words is "three hundred one billion, one hundred thirty million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •