Base | Representation |
---|---|
bin | 100000000000100… |
… | …0011111100101001 |
3 | 2202211221212122121 |
4 | 1000001003330221 |
5 | 4144422121022 |
6 | 254323551241 |
7 | 35421010021 |
oct | 10001037451 |
9 | 2684855577 |
10 | 1074020137 |
11 | 501290253 |
12 | 25b82b521 |
13 | 141685798 |
14 | a28d8a81 |
15 | 644532c7 |
hex | 40043f29 |
1074020137 has 4 divisors (see below), whose sum is σ = 1082218896. Its totient is φ = 1065821380.
The previous prime is 1074020119. The next prime is 1074020147. The reversal of 1074020137 is 7310204701.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 1074020137 - 211 = 1074018089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1074020147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4099183 + ... + 4099444.
It is an arithmetic number, because the mean of its divisors is an integer number (270554724).
Almost surely, 21074020137 is an apocalyptic number.
It is an amenable number.
1074020137 is a deficient number, since it is larger than the sum of its proper divisors (8198759).
1074020137 is an equidigital number, since it uses as much as digits as its factorization.
1074020137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8198758.
The product of its (nonzero) digits is 1176, while the sum is 25.
The square root of 1074020137 is about 32772.2464442095. The cubic root of 1074020137 is about 1024.0884656770.
Adding to 1074020137 its reverse (7310204701), we get a palindrome (8384224838).
The spelling of 1074020137 in words is "one billion, seventy-four million, twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •