Base | Representation |
---|---|
bin | 10100011010010100011… |
… | …010110011010000101011 |
3 | 11222002111001021212021211 |
4 | 110122110122303100223 |
5 | 140440111221022141 |
6 | 2552211312213551 |
7 | 203223650054326 |
oct | 24322432632053 |
9 | 4862431255254 |
10 | 1402649392171 |
11 | 4a09510188a5 |
12 | 1a7a1453a2b7 |
13 | a2366781651 |
14 | 4bc624277bd |
15 | 26745a49d81 |
hex | 146946b342b |
1402649392171 has 2 divisors, whose sum is σ = 1402649392172. Its totient is φ = 1402649392170.
The previous prime is 1402649392169. The next prime is 1402649392247. The reversal of 1402649392171 is 1712939462041.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1402649392171 - 21 = 1402649392169 is a prime.
Together with 1402649392169, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1402649392271) 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, 701324696085 + 701324696086.
It is an arithmetic number, because the mean of its divisors is an integer number (701324696086).
Almost surely, 21402649392171 is an apocalyptic number.
1402649392171 is a deficient number, since it is larger than the sum of its proper divisors (1).
1402649392171 is an equidigital number, since it uses as much as digits as its factorization.
1402649392171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 49.
The spelling of 1402649392171 in words is "one trillion, four hundred two billion, six hundred forty-nine million, three hundred ninety-two thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •