Base | Representation |
---|---|
bin | 1000110000111001100… |
… | …01110110111110110111 |
3 | 1001210021022020120020020 |
4 | 10120130301312332313 |
5 | 14413203404334111 |
6 | 350200520340223 |
7 | 30520203245223 |
oct | 4303461667667 |
9 | 1053238216206 |
10 | 301130543031 |
11 | 106788382a8a |
12 | 4a440014673 |
13 | 22520114796 |
14 | 10809351783 |
15 | 7c76a79906 |
hex | 461cc76fb7 |
301130543031 has 32 divisors (see below), whose sum is σ = 440285932800. Its totient is φ = 182404005120.
The previous prime is 301130543003. The next prime is 301130543047. The reversal of 301130543031 is 130345031103.
It is not a de Polignac number, because 301130543031 - 27 = 301130542903 is a prime.
It is a super-2 number, since 2×3011305430312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 301130542992 and 301130543010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301130543071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 954096 + ... + 1229861.
It is an arithmetic number, because the mean of its divisors is an integer number (13758935400).
Almost surely, 2301130543031 is an apocalyptic number.
301130543031 is a deficient number, since it is larger than the sum of its proper divisors (139155389769).
301130543031 is a wasteful number, since it uses less digits than its factorization.
301130543031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184079.
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 301130543031 its reverse (130345031103), we get a palindrome (431475574134).
The spelling of 301130543031 in words is "three hundred one billion, one hundred thirty million, five hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •