Base | Representation |
---|---|
bin | 1000110001010001011… |
… | …11101011111100100011 |
3 | 1001210210022000002012101 |
4 | 10120220233223330203 |
5 | 14414111303101011 |
6 | 350232451311231 |
7 | 30525161535001 |
oct | 4305057537443 |
9 | 1053708002171 |
10 | 301331300131 |
11 | 106880732844 |
12 | 4a4972ab517 |
13 | 225528a5574 |
14 | 10827c8da71 |
15 | 7c894d32c1 |
hex | 4628bebf23 |
301331300131 has 8 divisors (see below), whose sum is σ = 303402434400. Its totient is φ = 299260816512.
The previous prime is 301331300113. The next prime is 301331300143. The reversal of 301331300131 is 131003133103.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 301331300131 - 25 = 301331300099 is a prime.
It is a super-2 number, since 2×3013313001312 (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 = 301331300099 and 301331300108.
It is not an unprimeable number, because it can be changed into a prime (301331300111) 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, 785691 + ... + 1104523.
It is an arithmetic number, because the mean of its divisors is an integer number (37925304300).
Almost surely, 2301331300131 is an apocalyptic number.
301331300131 is a deficient number, since it is larger than the sum of its proper divisors (2071134269).
301331300131 is a wasteful number, since it uses less digits than its factorization.
301331300131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325325.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 301331300131 its reverse (131003133103), we get a palindrome (432334433234).
The spelling of 301331300131 in words is "three hundred one billion, three hundred thirty-one million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •