Base | Representation |
---|---|
bin | 110000011011011110… |
… | …0011010110100110001 |
3 | 100221110000021101101011 |
4 | 1200312330122310301 |
5 | 3200443230221111 |
6 | 115435530510521 |
7 | 10341146053261 |
oct | 1406674326461 |
9 | 327400241334 |
10 | 104001023281 |
11 | 40119959111 |
12 | 181a5895441 |
13 | 9a656cbb3c |
14 | 506859d7a1 |
15 | 2a8a613021 |
hex | 1836f1ad31 |
104001023281 has 2 divisors, whose sum is σ = 104001023282. Its totient is φ = 104001023280.
The previous prime is 104001023219. The next prime is 104001023297. The reversal of 104001023281 is 182320100401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70840613281 + 33160410000 = 266159^2 + 182100^2 .
It is a cyclic number.
It is not a de Polignac number, because 104001023281 - 223 = 103992634673 is a prime.
It is a super-2 number, since 2×1040010232812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (104001023381) 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, 52000511640 + 52000511641.
It is an arithmetic number, because the mean of its divisors is an integer number (52000511641).
Almost surely, 2104001023281 is an apocalyptic number.
It is an amenable number.
104001023281 is a deficient number, since it is larger than the sum of its proper divisors (1).
104001023281 is an equidigital number, since it uses as much as digits as its factorization.
104001023281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 104001023281 its reverse (182320100401), we get a palindrome (286321123682).
The spelling of 104001023281 in words is "one hundred four billion, one million, twenty-three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •