Base | Representation |
---|---|
bin | 10010001101101010001011… |
… | …101100110000001101010111 |
3 | 101111121211002111221112100212 |
4 | 102031222023230300031113 |
5 | 40444403413330211343 |
6 | 442211011002200035 |
7 | 22605200001162002 |
oct | 2215521354601527 |
9 | 344554074845325 |
10 | 80103483835223 |
11 | 23583773371202 |
12 | 8b987127b301b |
13 | 359095936b704 |
14 | 15ad05a5a6539 |
15 | 93da1e93ac18 |
hex | 48da8bb30357 |
80103483835223 has 2 divisors, whose sum is σ = 80103483835224. Its totient is φ = 80103483835222.
The previous prime is 80103483835187. The next prime is 80103483835259. The reversal of 80103483835223 is 32253838430108.
It is a balanced prime because it is at equal distance from previous prime (80103483835187) and next prime (80103483835259).
It is a cyclic number.
It is not a de Polignac number, because 80103483835223 - 230 = 80102410093399 is a prime.
It is a super-2 number, since 2×801034838352232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (80103483835283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40051741917611 + 40051741917612.
It is an arithmetic number, because the mean of its divisors is an integer number (40051741917612).
Almost surely, 280103483835223 is an apocalyptic number.
80103483835223 is a deficient number, since it is larger than the sum of its proper divisors (1).
80103483835223 is an equidigital number, since it uses as much as digits as its factorization.
80103483835223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3317760, while the sum is 50.
The spelling of 80103483835223 in words is "eighty trillion, one hundred three billion, four hundred eighty-three million, eight hundred thirty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •