Base | Representation |
---|---|
bin | 11101000110110100001… |
… | …10010100111000001001 |
3 | 10112121102002121022120011 |
4 | 32203122012110320021 |
5 | 112341141411113022 |
6 | 2043234035431521 |
7 | 132153125344645 |
oct | 16433206247011 |
9 | 3477362538504 |
10 | 1000091504137 |
11 | 356155644350 |
12 | 1419a87555a1 |
13 | 734012262bb |
14 | 36594665c25 |
15 | 1b0347dd977 |
hex | e8da194e09 |
1000091504137 has 4 divisors (see below), whose sum is σ = 1091008913616. Its totient is φ = 909174094660.
The previous prime is 1000091504117. The next prime is 1000091504149. The reversal of 1000091504137 is 7314051900001.
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 1000091504137 - 211 = 1000091502089 is a prime.
It is a super-2 number, since 2×10000915041372 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000091504099 and 1000091504108.
It is not an unprimeable number, because it can be changed into a prime (1000091504117) 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, 45458704723 + ... + 45458704744.
It is an arithmetic number, because the mean of its divisors is an integer number (272752228404).
Almost surely, 21000091504137 is an apocalyptic number.
It is an amenable number.
1000091504137 is a deficient number, since it is larger than the sum of its proper divisors (90917409479).
1000091504137 is an equidigital number, since it uses as much as digits as its factorization.
1000091504137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90917409478.
The product of its (nonzero) digits is 3780, while the sum is 31.
The spelling of 1000091504137 in words is "one trillion, ninety-one million, five hundred four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •