Base | Representation |
---|---|
bin | 101100101001101111010010… |
… | …001000101000000000001011 |
3 | 221202022222002012100100000102 |
4 | 230221233102020220000023 |
5 | 201220011440134320441 |
6 | 1533400442400000015 |
7 | 56236103561423066 |
oct | 5451572210500013 |
9 | 852288065310012 |
10 | 196382315151371 |
11 | 576342aa2545a8 |
12 | 1a03826000000b |
13 | 8576a07c7550b |
14 | 366cd51c558dd |
15 | 17a854c12769b |
hex | b29bd222800b |
196382315151371 has 2 divisors, whose sum is σ = 196382315151372. Its totient is φ = 196382315151370.
The previous prime is 196382315151359. The next prime is 196382315151391. The reversal of 196382315151371 is 173151513283691.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 196382315151371 - 218 = 196382314889227 is a prime.
It is not a weakly prime, because it can be changed into another prime (196382315151391) 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 as a sum of consecutive naturals, namely, 98191157575685 + 98191157575686.
It is an arithmetic number, because the mean of its divisors is an integer number (98191157575686).
Almost surely, 2196382315151371 is an apocalyptic number.
196382315151371 is a deficient number, since it is larger than the sum of its proper divisors (1).
196382315151371 is an equidigital number, since it uses as much as digits as its factorization.
196382315151371 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4082400, while the sum is 56.
The spelling of 196382315151371 in words is "one hundred ninety-six trillion, three hundred eighty-two billion, three hundred fifteen million, one hundred fifty-one thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •