Base | Representation |
---|---|
bin | 100110100111001101011000… |
… | …000000100110111110111111 |
3 | 211021021122120220211012202121 |
4 | 212213031120000212332333 |
5 | 134224313221222034411 |
6 | 1401102152333103411 |
7 | 50525050403055064 |
oct | 4647153000467677 |
9 | 737248526735677 |
10 | 169820188471231 |
11 | 4a123379209371 |
12 | 17068359627b67 |
13 | 739ac8a28703c |
14 | 2dd14ab8dcc6b |
15 | 149762d3da571 |
hex | 9a7358026fbf |
169820188471231 has 2 divisors, whose sum is σ = 169820188471232. Its totient is φ = 169820188471230.
The previous prime is 169820188471229. The next prime is 169820188471309. The reversal of 169820188471231 is 132174881028961.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 169820188471231 - 21 = 169820188471229 is a prime.
It is a super-2 number, since 2×1698201884712312 (a number of 29 digits) contains 22 as substring.
Together with 169820188471229, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 169820188471231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (169820188471631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 84910094235615 + 84910094235616.
It is an arithmetic number, because the mean of its divisors is an integer number (84910094235616).
Almost surely, 2169820188471231 is an apocalyptic number.
169820188471231 is a deficient number, since it is larger than the sum of its proper divisors (1).
169820188471231 is an equidigital number, since it uses as much as digits as its factorization.
169820188471231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9289728, while the sum is 61.
The spelling of 169820188471231 in words is "one hundred sixty-nine trillion, eight hundred twenty billion, one hundred eighty-eight million, four hundred seventy-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •