Base | Representation |
---|---|
bin | 1011011001111101000… |
… | …1110100010010001001 |
3 | 200201202210112210001210 |
4 | 2312133101310102021 |
5 | 11202244104320030 |
6 | 230003302003333 |
7 | 20104501421511 |
oct | 2663721642211 |
9 | 621683483053 |
10 | 195945776265 |
11 | 76111311978 |
12 | 31b85a16549 |
13 | 156293c3a15 |
14 | 96ab894841 |
15 | 516c58cbb0 |
hex | 2d9f474489 |
195945776265 has 16 divisors (see below), whose sum is σ = 313629897600. Its totient is φ = 104465528832.
The previous prime is 195945776251. The next prime is 195945776287. The reversal of 195945776265 is 562677549591.
195945776265 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 195945776265 - 211 = 195945774217 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 195945776196 and 195945776205.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2388645 + ... + 2469314.
It is an arithmetic number, because the mean of its divisors is an integer number (19601868600).
Almost surely, 2195945776265 is an apocalyptic number.
195945776265 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
195945776265 is a deficient number, since it is larger than the sum of its proper divisors (117684121335).
195945776265 is a wasteful number, since it uses less digits than its factorization.
195945776265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4860656.
The product of its digits is 142884000, while the sum is 66.
The spelling of 195945776265 in words is "one hundred ninety-five billion, nine hundred forty-five million, seven hundred seventy-six thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •