Base | Representation |
---|---|
bin | 110000110010011110… |
… | …1110001011101000101 |
3 | 101000102211010110202021 |
4 | 1201210331301131011 |
5 | 3204033410130203 |
6 | 120044311443141 |
7 | 10366242624364 |
oct | 1414475613505 |
9 | 330384113667 |
10 | 104773130053 |
11 | 40485778389 |
12 | 183803864b1 |
13 | 9b59666957 |
14 | 50dcd477db |
15 | 2ad32ca5bd |
hex | 1864f71745 |
104773130053 has 4 divisors (see below), whose sum is σ = 105234685920. Its totient is φ = 104311574188.
The previous prime is 104773130041. The next prime is 104773130069. The reversal of 104773130053 is 350031377401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 104773130053 - 213 = 104773121861 is a prime.
It is a super-2 number, since 2×1047731300532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104773130653) 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 in 3 ways as a sum of consecutive naturals, for example, 230777593 + ... + 230778046.
It is an arithmetic number, because the mean of its divisors is an integer number (26308671480).
Almost surely, 2104773130053 is an apocalyptic number.
It is an amenable number.
104773130053 is a deficient number, since it is larger than the sum of its proper divisors (461555867).
104773130053 is an equidigital number, since it uses as much as digits as its factorization.
104773130053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461555866.
The product of its (nonzero) digits is 26460, while the sum is 34.
The spelling of 104773130053 in words is "one hundred four billion, seven hundred seventy-three million, one hundred thirty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •