Base | Representation |
---|---|
bin | 100000000000100… |
… | …1101101011100111 |
3 | 2202212000220100021 |
4 | 1000001031223213 |
5 | 4144424410012 |
6 | 254324500011 |
7 | 35421234166 |
oct | 10001155347 |
9 | 2685026307 |
10 | 1074060007 |
11 | 5013081a9 |
12 | 25b84a607 |
13 | 14169a987 |
14 | a29093dd |
15 | 64460007 |
hex | 4004dae7 |
1074060007 has 4 divisors (see below), whose sum is σ = 1108707136. Its totient is φ = 1039412880.
The previous prime is 1074059989. The next prime is 1074060047. The reversal of 1074060007 is 7000604701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7000604701 = 19 ⋅368452879.
It is a cyclic number.
It is not a de Polignac number, because 1074060007 - 215 = 1074027239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1074060047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17323518 + ... + 17323579.
It is an arithmetic number, because the mean of its divisors is an integer number (277176784).
Almost surely, 21074060007 is an apocalyptic number.
1074060007 is a deficient number, since it is larger than the sum of its proper divisors (34647129).
1074060007 is an equidigital number, since it uses as much as digits as its factorization.
1074060007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34647128.
The product of its (nonzero) digits is 1176, while the sum is 25.
The square root of 1074060007 is about 32772.8547276553. The cubic root of 1074060007 is about 1024.1011376623.
Adding to 1074060007 its reverse (7000604701), we get a palindrome (8074664708).
The spelling of 1074060007 in words is "one billion, seventy-four million, sixty thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.736 sec. • engine limits •