Base | Representation |
---|---|
bin | 100000000000101… |
… | …1001111010011011 |
3 | 2202212010110001211 |
4 | 1000001121322123 |
5 | 4144433010412 |
6 | 254325523551 |
7 | 35421533230 |
oct | 10001317233 |
9 | 2685113054 |
10 | 1074110107 |
11 | 501341904 |
12 | 25b8735b7 |
13 | 1416b7715 |
14 | a291d787 |
15 | 6446eca7 |
hex | 40059e9b |
1074110107 has 4 divisors (see below), whose sum is σ = 1227554416. Its totient is φ = 920665800.
The previous prime is 1074110077. The next prime is 1074110113. The reversal of 1074110107 is 7010114701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7010114701 = 55127 ⋅127163.
It is a cyclic number.
It is not a de Polignac number, because 1074110107 - 215 = 1074077339 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1074120107) 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, 76722144 + ... + 76722157.
It is an arithmetic number, because the mean of its divisors is an integer number (306888604).
Almost surely, 21074110107 is an apocalyptic number.
1074110107 is a deficient number, since it is larger than the sum of its proper divisors (153444309).
1074110107 is an equidigital number, since it uses as much as digits as its factorization.
1074110107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153444308.
The product of its (nonzero) digits is 196, while the sum is 22.
The square root of 1074110107 is about 32773.6190708320. The cubic root of 1074110107 is about 1024.1170606302.
Adding to 1074110107 its reverse (7010114701), we get a palindrome (8084224808).
The spelling of 1074110107 in words is "one billion, seventy-four million, one hundred ten thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •