Base | Representation |
---|---|
bin | 10111001110101111101010… |
… | …100000001101000000000001 |
3 | 111101202012021222112110010001 |
4 | 113032233222200031000001 |
5 | 101342411210233132403 |
6 | 1001143251235040001 |
7 | 30343263150601534 |
oct | 2716575240150001 |
9 | 441665258473101 |
10 | 102168321380353 |
11 | 2a610383995368 |
12 | b560aa4140001 |
13 | 450157b932617 |
14 | 1b32d8a41aa1b |
15 | bc2974a68c1d |
hex | 5cebea80d001 |
102168321380353 has 2 divisors, whose sum is σ = 102168321380354. Its totient is φ = 102168321380352.
The previous prime is 102168321380347. The next prime is 102168321380423. The reversal of 102168321380353 is 353083123861201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101634767099649 + 533554280704 = 10081407^2 + 730448^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102168321380353 is a prime.
It is a super-3 number, since 3×1021683213803533 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (102168321320353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51084160690176 + 51084160690177.
It is an arithmetic number, because the mean of its divisors is an integer number (51084160690177).
Almost surely, 2102168321380353 is an apocalyptic number.
It is an amenable number.
102168321380353 is a deficient number, since it is larger than the sum of its proper divisors (1).
102168321380353 is an equidigital number, since it uses as much as digits as its factorization.
102168321380353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 622080, while the sum is 46.
The spelling of 102168321380353 in words is "one hundred two trillion, one hundred sixty-eight billion, three hundred twenty-one million, three hundred eighty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •