Base | Representation |
---|---|
bin | 110000011100001101… |
… | …1111100110010001101 |
3 | 100221111202101200121112 |
4 | 1200320123330302031 |
5 | 3201021133103221 |
6 | 115442223341405 |
7 | 10341601654301 |
oct | 1407033746215 |
9 | 327452350545 |
10 | 104026066061 |
11 | 40132003125 |
12 | 181b2151865 |
13 | 9a6a959658 |
14 | 506ba3bd01 |
15 | 2a8c90d15b |
hex | 18386fcc8d |
104026066061 has 2 divisors, whose sum is σ = 104026066062. Its totient is φ = 104026066060.
The previous prime is 104026066057. The next prime is 104026066153. The reversal of 104026066061 is 160660620401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102739480900 + 1286585161 = 320530^2 + 35869^2 .
It is an emirp because it is prime and its reverse (160660620401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104026066061 - 22 = 104026066057 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104026065061) 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, 52013033030 + 52013033031.
It is an arithmetic number, because the mean of its divisors is an integer number (52013033031).
Almost surely, 2104026066061 is an apocalyptic number.
It is an amenable number.
104026066061 is a deficient number, since it is larger than the sum of its proper divisors (1).
104026066061 is an equidigital number, since it uses as much as digits as its factorization.
104026066061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 104026066061 its reverse (160660620401), we get a palindrome (264686686462).
The spelling of 104026066061 in words is "one hundred four billion, twenty-six million, sixty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •