Base | Representation |
---|---|
bin | 1001100110001000100110… |
… | …0100100101111010101101 |
3 | 1101100122022202021202221110 |
4 | 2121202021210211322231 |
5 | 2340330412411000221 |
6 | 34234540244422233 |
7 | 2136160236105021 |
oct | 231421144457255 |
9 | 41318282252843 |
10 | 10550747750061 |
11 | 33a8602058222 |
12 | 12249800a7979 |
13 | 5b6c14c3366c |
14 | 2869320ca381 |
15 | 1346b0dc1776 |
hex | 99889925ead |
10550747750061 has 4 divisors (see below), whose sum is σ = 14067663666752. Its totient is φ = 7033831833372.
The previous prime is 10550747750051. The next prime is 10550747750113. The reversal of 10550747750061 is 16005774705501.
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 not a de Polignac number, because 10550747750061 - 225 = 10550714195629 is a prime.
It is a super-2 number, since 2×105507477500612 (a number of 27 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 (10550747750051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1758457958341 + ... + 1758457958346.
It is an arithmetic number, because the mean of its divisors is an integer number (3516915916688).
Almost surely, 210550747750061 is an apocalyptic number.
It is an amenable number.
10550747750061 is a deficient number, since it is larger than the sum of its proper divisors (3516915916691).
10550747750061 is an equidigital number, since it uses as much as digits as its factorization.
10550747750061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3516915916690.
The product of its (nonzero) digits is 1029000, while the sum is 48.
The spelling of 10550747750061 in words is "ten trillion, five hundred fifty billion, seven hundred forty-seven million, seven hundred fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •