Base | Representation |
---|---|
bin | 110000101110001110… |
… | …0001101010000110011 |
3 | 101000001212000110200122 |
4 | 1201130130031100303 |
5 | 3203240302111311 |
6 | 120022202240455 |
7 | 10362555201122 |
oct | 1413434152063 |
9 | 330055013618 |
10 | 104630113331 |
11 | 40411a75847 |
12 | 183404b612b |
13 | 9b35b41483 |
14 | 50c7d59ab9 |
15 | 2ac597a0db |
hex | 185c70d433 |
104630113331 has 2 divisors, whose sum is σ = 104630113332. Its totient is φ = 104630113330.
The previous prime is 104630113327. The next prime is 104630113363. The reversal of 104630113331 is 133311036401.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 104630113331 - 22 = 104630113327 is a prime.
It is a super-3 number, since 3×1046301133313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 104630113331.
It is not a weakly prime, because it can be changed into another prime (104630113381) 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, 52315056665 + 52315056666.
It is an arithmetic number, because the mean of its divisors is an integer number (52315056666).
Almost surely, 2104630113331 is an apocalyptic number.
104630113331 is a deficient number, since it is larger than the sum of its proper divisors (1).
104630113331 is an equidigital number, since it uses as much as digits as its factorization.
104630113331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 104630113331 its reverse (133311036401), we get a palindrome (237941149732).
The spelling of 104630113331 in words is "one hundred four billion, six hundred thirty million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •