Base | Representation |
---|---|
bin | 101100100010111010011100… |
… | …101110010010111000101001 |
3 | 221200200010101110200000102101 |
4 | 230202322130232102320221 |
5 | 201134320333002341132 |
6 | 1532401151311333401 |
7 | 56160160256254033 |
oct | 5442723456227051 |
9 | 850603343600371 |
10 | 195913267621417 |
11 | 5747339413aa65 |
12 | 19b81378b21261 |
13 | 8541707627998 |
14 | 3654377774c53 |
15 | 179b248a617e7 |
hex | b22e9cb92e29 |
195913267621417 has 2 divisors, whose sum is σ = 195913267621418. Its totient is φ = 195913267621416.
The previous prime is 195913267621339. The next prime is 195913267621441. The reversal of 195913267621417 is 714126762319591.
195913267621417 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 187259957015616 + 8653310605801 = 13684296^2 + 2941651^2 .
It is a cyclic number.
It is not a de Polignac number, because 195913267621417 - 211 = 195913267619369 is a prime.
It is not a weakly prime, because it can be changed into another prime (195913267651417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97956633810708 + 97956633810709.
It is an arithmetic number, because the mean of its divisors is an integer number (97956633810709).
Almost surely, 2195913267621417 is an apocalyptic number.
It is an amenable number.
195913267621417 is a deficient number, since it is larger than the sum of its proper divisors (1).
195913267621417 is an equidigital number, since it uses as much as digits as its factorization.
195913267621417 is an evil number, because the sum of its binary digits is even.
The product of its digits is 34292160, while the sum is 64.
The spelling of 195913267621417 in words is "one hundred ninety-five trillion, nine hundred thirteen billion, two hundred sixty-seven million, six hundred twenty-one thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •