Base | Representation |
---|---|
bin | 110000011100011011… |
… | …1101000100110000101 |
3 | 100221112021001101210202 |
4 | 1200320313220212011 |
5 | 3201030012322042 |
6 | 115443043100245 |
7 | 10342020441563 |
oct | 1407067504605 |
9 | 327467041722 |
10 | 104033323397 |
11 | 4013610a723 |
12 | 181b4671685 |
13 | 9a6c2caa33 |
14 | 506c9aaa33 |
15 | 2a8d393632 |
hex | 1838de8985 |
104033323397 has 2 divisors, whose sum is σ = 104033323398. Its totient is φ = 104033323396.
The previous prime is 104033323307. The next prime is 104033323409. The reversal of 104033323397 is 793323330401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87730885636 + 16302437761 = 296194^2 + 127681^2 .
It is a cyclic number.
It is not a de Polignac number, because 104033323397 - 210 = 104033322373 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104033323397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104033323307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52016661698 + 52016661699.
It is an arithmetic number, because the mean of its divisors is an integer number (52016661699).
Almost surely, 2104033323397 is an apocalyptic number.
It is an amenable number.
104033323397 is a deficient number, since it is larger than the sum of its proper divisors (1).
104033323397 is an equidigital number, since it uses as much as digits as its factorization.
104033323397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 38.
Adding to 104033323397 its reverse (793323330401), we get a palindrome (897356653798).
The spelling of 104033323397 in words is "one hundred four billion, thirty-three million, three hundred twenty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.058 sec. • engine limits •