Base | Representation |
---|---|
bin | 111110000100010… |
… | …101101111111011 |
3 | 2200120102210102111 |
4 | 332010111233323 |
5 | 4113034400201 |
6 | 251155113151 |
7 | 34543055044 |
oct | 7604255773 |
9 | 2616383374 |
10 | 1041325051 |
11 | 494889a18 |
12 | 2508a27b7 |
13 | 137978b90 |
14 | 9c4278cb |
15 | 61645b51 |
hex | 3e115bfb |
1041325051 has 4 divisors (see below), whose sum is σ = 1121426992. Its totient is φ = 961223112.
The previous prime is 1041325031. The next prime is 1041325057. The reversal of 1041325051 is 1505231401.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1505231401 = 41 ⋅36712961.
It is a cyclic number.
It is not a de Polignac number, because 1041325051 - 27 = 1041324923 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1041325057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40050951 + ... + 40050976.
It is an arithmetic number, because the mean of its divisors is an integer number (280356748).
Almost surely, 21041325051 is an apocalyptic number.
1041325051 is a deficient number, since it is larger than the sum of its proper divisors (80101941).
1041325051 is an equidigital number, since it uses as much as digits as its factorization.
1041325051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80101940.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 1041325051 is about 32269.5684972700. The cubic root of 1041325051 is about 1013.5895057867.
Adding to 1041325051 its reverse (1505231401), we get a palindrome (2546556452).
The spelling of 1041325051 in words is "one billion, forty-one million, three hundred twenty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •