Base | Representation |
---|---|
bin | 11010111001100… |
… | …111100110101001 |
3 | 1011110020000201210 |
4 | 122321213212221 |
5 | 1411013441131 |
6 | 112441103333 |
7 | 14120042355 |
oct | 3271474651 |
9 | 1143200653 |
10 | 451312041 |
11 | 211832464 |
12 | 107187b49 |
13 | 72668c5b |
14 | 43d20465 |
15 | 2994c146 |
hex | 1ae679a9 |
451312041 has 4 divisors (see below), whose sum is σ = 601749392. Its totient is φ = 300874692.
The previous prime is 451312033. The next prime is 451312091. The reversal of 451312041 is 140213154.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 451312041 - 23 = 451312033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 451311999 and 451312017.
It is not an unprimeable number, because it can be changed into a prime (451312031) 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 3 ways as a sum of consecutive naturals, for example, 75218671 + ... + 75218676.
It is an arithmetic number, because the mean of its divisors is an integer number (150437348).
Almost surely, 2451312041 is an apocalyptic number.
It is an amenable number.
451312041 is a deficient number, since it is larger than the sum of its proper divisors (150437351).
451312041 is a wasteful number, since it uses less digits than its factorization.
451312041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150437350.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 451312041 is about 21244.1060296733. The cubic root of 451312041 is about 767.0534722563.
Adding to 451312041 its reverse (140213154), we get a palindrome (591525195).
The spelling of 451312041 in words is "four hundred fifty-one million, three hundred twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •