Base | Representation |
---|---|
bin | 1000111000010101110… |
… | …00000100110101011001 |
3 | 1002011120200210121220000 |
4 | 10130022320010311121 |
5 | 14444344014300131 |
6 | 352101134523213 |
7 | 31021166660625 |
oct | 4341270046531 |
9 | 1064520717800 |
10 | 305125150041 |
11 | 108448213398 |
12 | 4b175966509 |
13 | 22a0889857a |
14 | 10aa7aa0185 |
15 | 7e0c5d6ce6 |
hex | 470ae04d59 |
305125150041 has 40 divisors (see below), whose sum is σ = 461648636064. Its totient is φ = 200812279680.
The previous prime is 305125150021. The next prime is 305125150133. The reversal of 305125150041 is 140051521503.
305125150041 is a `hidden beast` number, since 30 + 5 + 125 + 1 + 500 + 4 + 1 = 666.
It is not a de Polignac number, because 305125150041 - 227 = 304990932313 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 305125149987 and 305125150014.
It is not an unprimeable number, because it can be changed into a prime (305125150021) 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 39 ways as a sum of consecutive naturals, for example, 9133330 + ... + 9166676.
Almost surely, 2305125150041 is an apocalyptic number.
It is an amenable number.
305125150041 is a deficient number, since it is larger than the sum of its proper divisors (156523486023).
305125150041 is a wasteful number, since it uses less digits than its factorization.
305125150041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34803 (or 34794 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 305125150041 its reverse (140051521503), we get a palindrome (445176671544).
The spelling of 305125150041 in words is "three hundred five billion, one hundred twenty-five million, one hundred fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •