Base | Representation |
---|---|
bin | 110000100101010010… |
… | …0011000011101001011 |
3 | 100222021221210200002100 |
4 | 1201022210120131023 |
5 | 3202132022011233 |
6 | 115532331404443 |
7 | 10352254430004 |
oct | 1411244303513 |
9 | 328257720070 |
10 | 104330266443 |
11 | 402787963a7 |
12 | 18277bb3723 |
13 | 9ab8998290 |
14 | 509a1c61ab |
15 | 2aa949b813 |
hex | 184a91874b |
104330266443 has 48 divisors (see below), whose sum is σ = 169973766144. Its totient is φ = 61184756160.
The previous prime is 104330266399. The next prime is 104330266451. The reversal of 104330266443 is 344662033401.
104330266443 is a `hidden beast` number, since 1 + 0 + 4 + 3 + 3 + 0 + 2 + 6 + 644 + 3 = 666.
It is not a de Polignac number, because 104330266443 - 26 = 104330266379 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104330266398 and 104330266407.
It is not an unprimeable number, because it can be changed into a prime (104330226443) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 657730 + ... + 800792.
It is an arithmetic number, because the mean of its divisors is an integer number (3541120128).
Almost surely, 2104330266443 is an apocalyptic number.
104330266443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
104330266443 is a deficient number, since it is larger than the sum of its proper divisors (65643499701).
104330266443 is a wasteful number, since it uses less digits than its factorization.
104330266443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143376 (or 143373 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 36.
Adding to 104330266443 its reverse (344662033401), we get a palindrome (448992299844).
The spelling of 104330266443 in words is "one hundred four billion, three hundred thirty million, two hundred sixty-six thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.528 sec. • engine limits •