Base | Representation |
---|---|
bin | 1000101111000001001… |
… | …11001100011000010011 |
3 | 1001200122221211021002200 |
4 | 10113200213030120103 |
5 | 14404122001123011 |
6 | 345512421014243 |
7 | 30453165243636 |
oct | 4274047143023 |
9 | 1050587737080 |
10 | 300121114131 |
11 | 10630a5aa123 |
12 | 4a1b9b54383 |
13 | 223bbc55987 |
14 | 1075126bc1d |
15 | 7c18134856 |
hex | 45e09cc613 |
300121114131 has 24 divisors (see below), whose sum is σ = 446418532560. Its totient is φ = 194151162816.
The previous prime is 300121114103. The next prime is 300121114169. The reversal of 300121114131 is 131411121003.
It is a happy number.
300121114131 is a `hidden beast` number, since 300 + 121 + 114 + 131 = 666.
It is not a de Polignac number, because 300121114131 - 29 = 300121113619 is a prime.
It is a super-2 number, since 2×3001211141312 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (300121114171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1083921 + ... + 1332338.
It is an arithmetic number, because the mean of its divisors is an integer number (18600772190).
Almost surely, 2300121114131 is an apocalyptic number.
300121114131 is a deficient number, since it is larger than the sum of its proper divisors (146297418429).
300121114131 is a wasteful number, since it uses less digits than its factorization.
300121114131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2416675 (or 2416672 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 300121114131 its reverse (131411121003), we get a palindrome (431532235134).
The spelling of 300121114131 in words is "three hundred billion, one hundred twenty-one million, one hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •