Base | Representation |
---|---|
bin | 1000110001001111001… |
… | …10000111001011100111 |
3 | 1001210201221201012021100 |
4 | 10120213212013023213 |
5 | 14414041333404111 |
6 | 350230522051143 |
7 | 30524535565251 |
oct | 4304746071347 |
9 | 1053657635240 |
10 | 301312013031 |
11 | 10687085a097 |
12 | 4a490949ab3 |
13 | 2254b8b1793 |
14 | 108254accd1 |
15 | 7c87973756 |
hex | 46279872e7 |
301312013031 has 24 divisors (see below), whose sum is σ = 445533454080. Its totient is φ = 196122373776.
The previous prime is 301312013029. The next prime is 301312013053. The reversal of 301312013031 is 130310213103.
It is a happy number.
301312013031 is a `hidden beast` number, since 30 + 131 + 201 + 303 + 1 = 666.
It is not a de Polignac number, because 301312013031 - 21 = 301312013029 is a prime.
It is a super-2 number, since 2×3013120130312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 301312012995 and 301312013013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301312013231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 787900 + ... + 1106078.
It is an arithmetic number, because the mean of its divisors is an integer number (18563893920).
Almost surely, 2301312013031 is an apocalyptic number.
301312013031 is a deficient number, since it is larger than the sum of its proper divisors (144221441049).
301312013031 is a wasteful number, since it uses less digits than its factorization.
301312013031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320675 (or 320672 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 301312013031 its reverse (130310213103), we get a palindrome (431622226134).
The spelling of 301312013031 in words is "three hundred one billion, three hundred twelve million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.223 sec. • engine limits •