Base | Representation |
---|---|
bin | 111111011010111… |
… | …111111000111001 |
3 | 2202011011221021111 |
4 | 333122333320321 |
5 | 4134343321131 |
6 | 253330040321 |
7 | 35240131246 |
oct | 7732777071 |
9 | 2664157244 |
10 | 1064042041 |
11 | 4a6695597 |
12 | 2584190a1 |
13 | 13c5a0b9a |
14 | a145c5cd |
15 | 63631ab1 |
hex | 3f6bfe39 |
1064042041 has 4 divisors (see below), whose sum is σ = 1092799972. Its totient is φ = 1035284112.
The previous prime is 1064042033. The next prime is 1064042059. The reversal of 1064042041 is 1402404601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1019205625 + 44836416 = 31925^2 + 6696^2 .
It is a cyclic number.
It is not a de Polignac number, because 1064042041 - 23 = 1064042033 is a prime.
It is a super-2 number, since 2×10640420412 = 2264370930030891362, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1064042011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14378910 + ... + 14378983.
It is an arithmetic number, because the mean of its divisors is an integer number (273199993).
Almost surely, 21064042041 is an apocalyptic number.
It is an amenable number.
1064042041 is a deficient number, since it is larger than the sum of its proper divisors (28757931).
1064042041 is an equidigital number, since it uses as much as digits as its factorization.
1064042041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28757930.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 1064042041 is about 32619.6572790089. The cubic root of 1064042041 is about 1020.9071901486.
Adding to 1064042041 its reverse (1402404601), we get a palindrome (2466446642).
The spelling of 1064042041 in words is "one billion, sixty-four million, forty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •