Base | Representation |
---|---|
bin | 110000011111011000… |
… | …0111100000011100001 |
3 | 100221210011011110001212 |
4 | 1200332300330003201 |
5 | 3201230322401033 |
6 | 115500535035505 |
7 | 10344331235231 |
oct | 1407660740341 |
9 | 327704143055 |
10 | 104132231393 |
11 | 40186a25773 |
12 | 1822180bb95 |
13 | 9a8694b488 |
14 | 507bb95cc1 |
15 | 2a96dce748 |
hex | 183ec3c0e1 |
104132231393 has 2 divisors, whose sum is σ = 104132231394. Its totient is φ = 104132231392.
The previous prime is 104132231353. The next prime is 104132231447. The reversal of 104132231393 is 393132231401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74885417104 + 29246814289 = 273652^2 + 171017^2 .
It is a cyclic number.
It is not a de Polignac number, because 104132231393 - 222 = 104128037089 is a prime.
It is a super-2 number, since 2×1041322313932 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (104132231353) 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, 52066115696 + 52066115697.
It is an arithmetic number, because the mean of its divisors is an integer number (52066115697).
Almost surely, 2104132231393 is an apocalyptic number.
It is an amenable number.
104132231393 is a deficient number, since it is larger than the sum of its proper divisors (1).
104132231393 is an equidigital number, since it uses as much as digits as its factorization.
104132231393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 32.
Adding to 104132231393 its reverse (393132231401), we get a palindrome (497264462794).
The spelling of 104132231393 in words is "one hundred four billion, one hundred thirty-two million, two hundred thirty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •