Base | Representation |
---|---|
bin | 11101010111110000111… |
… | …01110011100011011101 |
3 | 10120110220020202001000112 |
4 | 32223320131303203131 |
5 | 113013310333111143 |
6 | 2051341011335405 |
7 | 132624456125345 |
oct | 16537035634335 |
9 | 3513806661015 |
10 | 1009190910173 |
11 | 359aa4a60826 |
12 | 143707bb1565 |
13 | 7422146c924 |
14 | 36bb8d55d25 |
15 | 1b3b85a3e18 |
hex | eaf87738dd |
1009190910173 has 2 divisors, whose sum is σ = 1009190910174. Its totient is φ = 1009190910172.
The previous prime is 1009190909981. The next prime is 1009190910181. The reversal of 1009190910173 is 3710190919001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 966283102009 + 42907808164 = 982997^2 + 207142^2 .
It is a cyclic number.
It is not a de Polignac number, because 1009190910173 - 220 = 1009189861597 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1009190910173.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1009190010173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 504595455086 + 504595455087.
It is an arithmetic number, because the mean of its divisors is an integer number (504595455087).
Almost surely, 21009190910173 is an apocalyptic number.
It is an amenable number.
1009190910173 is a deficient number, since it is larger than the sum of its proper divisors (1).
1009190910173 is an equidigital number, since it uses as much as digits as its factorization.
1009190910173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15309, while the sum is 41.
The spelling of 1009190910173 in words is "one trillion, nine billion, one hundred ninety million, nine hundred ten thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •