Base | Representation |
---|---|
bin | 1011011001111000011… |
… | …1111111101001000011 |
3 | 200201201110010120221002 |
4 | 2312132013333221003 |
5 | 11202224131033011 |
6 | 230001331122215 |
7 | 20104145061344 |
oct | 2663607775103 |
9 | 621643116832 |
10 | 195926424131 |
11 | 761013a4379 |
12 | 31b7b44336b |
13 | 156253a9459 |
14 | 96a90980cb |
15 | 516aa18c3b |
hex | 2d9e1ffa43 |
195926424131 has 2 divisors, whose sum is σ = 195926424132. Its totient is φ = 195926424130.
The previous prime is 195926424119. The next prime is 195926424137. The reversal of 195926424131 is 131424629591.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 195926424131 - 218 = 195926161987 is a prime.
It is a super-2 number, since 2×1959264241312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (195926424137) by changing a digit.
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 as a sum of consecutive naturals, namely, 97963212065 + 97963212066.
It is an arithmetic number, because the mean of its divisors is an integer number (97963212066).
Almost surely, 2195926424131 is an apocalyptic number.
195926424131 is a deficient number, since it is larger than the sum of its proper divisors (1).
195926424131 is an equidigital number, since it uses as much as digits as its factorization.
195926424131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 466560, while the sum is 47.
The spelling of 195926424131 in words is "one hundred ninety-five billion, nine hundred twenty-six million, four hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •