Base | Representation |
---|---|
bin | 11101001110000110001… |
… | …00100100101111001001 |
3 | 10112222111111101101200022 |
4 | 32213003010210233021 |
5 | 112422143013324022 |
6 | 2045121543150225 |
7 | 132352026230345 |
oct | 16470304445711 |
9 | 3488444341608 |
10 | 1004000136137 |
11 | 3578809a2429 |
12 | 1426b9745375 |
13 | 738a4c371bb |
14 | 368457d4625 |
15 | 1b1b2a16c42 |
hex | e9c3124bc9 |
1004000136137 has 4 divisors (see below), whose sum is σ = 1004007528720. Its totient is φ = 1003992743556.
The previous prime is 1004000136047. The next prime is 1004000136173. The reversal of 1004000136137 is 7316310004001.
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 1004000136137 - 220 = 1003999087561 is a prime.
It is a super-2 number, since 2×10040001361372 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1004000136637) 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, 3488687 + ... + 3765492.
It is an arithmetic number, because the mean of its divisors is an integer number (251001882180).
Almost surely, 21004000136137 is an apocalyptic number.
It is an amenable number.
1004000136137 is a deficient number, since it is larger than the sum of its proper divisors (7392583).
1004000136137 is an equidigital number, since it uses as much as digits as its factorization.
1004000136137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7392582.
The product of its (nonzero) digits is 1512, while the sum is 26.
The spelling of 1004000136137 in words is "one trillion, four billion, one hundred thirty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •