Base | Representation |
---|---|
bin | 11101000110110100001… |
… | …10010100111000010101 |
3 | 10112121102002121022120121 |
4 | 32203122012110320111 |
5 | 112341141411113044 |
6 | 2043234035431541 |
7 | 132153125344663 |
oct | 16433206247025 |
9 | 3477362538517 |
10 | 1000091504149 |
11 | 356155644361 |
12 | 1419a87555b1 |
13 | 734012262ca |
14 | 36594665c33 |
15 | 1b0347dd984 |
hex | e8da194e15 |
1000091504149 has 2 divisors, whose sum is σ = 1000091504150. Its totient is φ = 1000091504148.
The previous prime is 1000091504117. The next prime is 1000091504171. The reversal of 1000091504149 is 9414051900001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 945892404900 + 54199099249 = 972570^2 + 232807^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000091504149 - 25 = 1000091504117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000091504189) 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 as a sum of consecutive naturals, namely, 500045752074 + 500045752075.
It is an arithmetic number, because the mean of its divisors is an integer number (500045752075).
Almost surely, 21000091504149 is an apocalyptic number.
It is an amenable number.
1000091504149 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000091504149 is an equidigital number, since it uses as much as digits as its factorization.
1000091504149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 34.
The spelling of 1000091504149 in words is "one trillion, ninety-one million, five hundred four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •