Base | Representation |
---|---|
bin | 1001110110000100000… |
… | …0011001100110001111 |
3 | 121011120001020011002221 |
4 | 2131201000121212033 |
5 | 10232340043004333 |
6 | 205410421000211 |
7 | 15135141433642 |
oct | 2354100314617 |
9 | 534501204087 |
10 | 169131219343 |
11 | 65801189429 |
12 | 28941853067 |
13 | 12c44c716a8 |
14 | 8286525a59 |
15 | 45ed438d2d |
hex | 276101998f |
169131219343 has 2 divisors, whose sum is σ = 169131219344. Its totient is φ = 169131219342.
The previous prime is 169131219317. The next prime is 169131219347. The reversal of 169131219343 is 343912131961.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 169131219343 - 25 = 169131219311 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 169131219343.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (169131219347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 84565609671 + 84565609672.
It is an arithmetic number, because the mean of its divisors is an integer number (84565609672).
Almost surely, 2169131219343 is an apocalyptic number.
169131219343 is a deficient number, since it is larger than the sum of its proper divisors (1).
169131219343 is an equidigital number, since it uses as much as digits as its factorization.
169131219343 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 104976, while the sum is 43.
The spelling of 169131219343 in words is "one hundred sixty-nine billion, one hundred thirty-one million, two hundred nineteen thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •