Base | Representation |
---|---|
bin | 1011010110101011010… |
… | …1010111001110110101 |
3 | 200122111110220112111020 |
4 | 2311222311113032311 |
5 | 11143443332331010 |
6 | 225340111131353 |
7 | 20043625544442 |
oct | 2655265271665 |
9 | 618443815436 |
10 | 195065902005 |
11 | 757aa686367 |
12 | 3197b213b59 |
13 | 15519025a70 |
14 | 9626a969c9 |
15 | 511a1d9470 |
hex | 2d6ad573b5 |
195065902005 has 16 divisors (see below), whose sum is σ = 336113554560. Its totient is φ = 96032443968.
The previous prime is 195065901983. The next prime is 195065902019. The reversal of 195065902005 is 500209560591.
It is not a de Polignac number, because 195065902005 - 215 = 195065869237 is a prime.
It is a super-2 number, since 2×1950659020052 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 500168785 + ... + 500169174.
It is an arithmetic number, because the mean of its divisors is an integer number (21007097160).
Almost surely, 2195065902005 is an apocalyptic number.
195065902005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
195065902005 is a deficient number, since it is larger than the sum of its proper divisors (141047652555).
195065902005 is a wasteful number, since it uses less digits than its factorization.
195065902005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000337980.
The product of its (nonzero) digits is 121500, while the sum is 42.
The spelling of 195065902005 in words is "one hundred ninety-five billion, sixty-five million, nine hundred two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •