Base | Representation |
---|---|
bin | 1011010110101101000… |
… | …1000100011010011101 |
3 | 200122111222120112101110 |
4 | 2311223101010122131 |
5 | 11144002212234312 |
6 | 225340530532233 |
7 | 20044044354306 |
oct | 2655321043235 |
9 | 618458515343 |
10 | 195073164957 |
11 | 75803797100 |
12 | 31981737079 |
13 | 1551a699878 |
14 | 9627a277ad |
15 | 511ab7143c |
hex | 2d6b44469d |
195073164957 has 48 divisors (see below), whose sum is σ = 290804623424. Its totient is φ = 116197804800.
The previous prime is 195073164941. The next prime is 195073164959. The reversal of 195073164957 is 759461370591.
195073164957 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 195073164957 - 24 = 195073164941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 195073164897 and 195073164906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195073164959) 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 in 47 ways as a sum of consecutive naturals, for example, 38149833 + ... + 38154945.
Almost surely, 2195073164957 is an apocalyptic number.
It is an amenable number.
195073164957 is a deficient number, since it is larger than the sum of its proper divisors (95731458467).
195073164957 is a wasteful number, since it uses less digits than its factorization.
195073164957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6922 (or 6911 counting only the distinct ones).
The product of its (nonzero) digits is 7144200, while the sum is 57.
The spelling of 195073164957 in words is "one hundred ninety-five billion, seventy-three million, one hundred sixty-four thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •