Base | Representation |
---|---|
bin | 10111110010110000100010… |
… | …100001010001011110111101 |
3 | 111201111210021220102201101022 |
4 | 113302300202201101132331 |
5 | 102203433144030104303 |
6 | 1010320223301553525 |
7 | 31020135053664152 |
oct | 2762604241213675 |
9 | 451453256381338 |
10 | 104643162347453 |
11 | 30384a09115874 |
12 | b8a06674158a5 |
13 | 4650a66b68a32 |
14 | 1bbaa8298a229 |
15 | c1701ea41438 |
hex | 5f2c228517bd |
104643162347453 has 2 divisors, whose sum is σ = 104643162347454. Its totient is φ = 104643162347452.
The previous prime is 104643162347413. The next prime is 104643162347461. The reversal of 104643162347453 is 354743261346401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90357990285124 + 14285172062329 = 9505682^2 + 3779573^2 .
It is a cyclic number.
It is not a de Polignac number, because 104643162347453 - 224 = 104643145570237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104643162347395 and 104643162347404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104643162347413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52321581173726 + 52321581173727.
It is an arithmetic number, because the mean of its divisors is an integer number (52321581173727).
Almost surely, 2104643162347453 is an apocalyptic number.
It is an amenable number.
104643162347453 is a deficient number, since it is larger than the sum of its proper divisors (1).
104643162347453 is an equidigital number, since it uses as much as digits as its factorization.
104643162347453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17418240, while the sum is 53.
The spelling of 104643162347453 in words is "one hundred four trillion, six hundred forty-three billion, one hundred sixty-two million, three hundred forty-seven thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •