Base | Representation |
---|---|
bin | 1001110100101001001011… |
… | …0011011111110000000001 |
3 | 1102020110201022121102000001 |
4 | 2131022102303133300001 |
5 | 2403421410223130243 |
6 | 34545242332000001 |
7 | 2163163222512241 |
oct | 235122263376001 |
9 | 42213638542001 |
10 | 10800010755073 |
11 | 3494293574201 |
12 | 1265145900001 |
13 | 60458a3cc337 |
14 | 294a1aa93b21 |
15 | 13adee15ba4d |
hex | 9d292cdfc01 |
10800010755073 has 8 divisors (see below), whose sum is σ = 10983536645760. Its totient is φ = 10616500693200.
The previous prime is 10800010755029. The next prime is 10800010755089. The reversal of 10800010755073 is 37055701000801.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10800010755073 - 241 = 8600987499521 is a prime.
It is a super-3 number, since 3×108000107550733 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10800010755013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2576953 + ... + 5314198.
It is an arithmetic number, because the mean of its divisors is an integer number (1372942080720).
Almost surely, 210800010755073 is an apocalyptic number.
It is an amenable number.
10800010755073 is a deficient number, since it is larger than the sum of its proper divisors (183525890687).
10800010755073 is an equidigital number, since it uses as much as digits as its factorization.
10800010755073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7914407.
The product of its (nonzero) digits is 29400, while the sum is 37.
Adding to 10800010755073 its reverse (37055701000801), we get a palindrome (47855711755874).
The spelling of 10800010755073 in words is "ten trillion, eight hundred billion, ten million, seven hundred fifty-five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •