Base | Representation |
---|---|
bin | 111011011001010111101… |
… | …0111011001100101001101 |
3 | 1001220102002222200210221121 |
4 | 1312302233113121211031 |
5 | 2032222100240244133 |
6 | 25210112140400541 |
7 | 1501533111120025 |
oct | 166625727314515 |
9 | 31812088623847 |
10 | 8163380009293 |
11 | 2668085218403 |
12 | aba14b546151 |
13 | 472a5a1a7782 |
14 | 203177038a85 |
15 | e253550c02d |
hex | 76caf5d994d |
8163380009293 has 2 divisors, whose sum is σ = 8163380009294. Its totient is φ = 8163380009292.
The previous prime is 8163380009273. The next prime is 8163380009399. The reversal of 8163380009293 is 3929000833618.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6313771849284 + 1849608160009 = 2512722^2 + 1360003^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8163380009293 is a prime.
It is a super-2 number, since 2×81633800092932 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 8163380009293.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8163380009203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4081690004646 + 4081690004647.
It is an arithmetic number, because the mean of its divisors is an integer number (4081690004647).
Almost surely, 28163380009293 is an apocalyptic number.
It is an amenable number.
8163380009293 is a deficient number, since it is larger than the sum of its proper divisors (1).
8163380009293 is an equidigital number, since it uses as much as digits as its factorization.
8163380009293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1679616, while the sum is 52.
The spelling of 8163380009293 in words is "eight trillion, one hundred sixty-three billion, three hundred eighty million, nine thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •