Base | Representation |
---|---|
bin | 1001100110001000010101… |
… | …0010011110101000111011 |
3 | 1101100122010202002001022020 |
4 | 2121202011102132220323 |
5 | 2340330241012032140 |
6 | 34234525200325523 |
7 | 2136155404244433 |
oct | 231420522365073 |
9 | 41318122061266 |
10 | 10550675892795 |
11 | 33a8575538855 |
12 | 12249600138a3 |
13 | 5b6c0309467c |
14 | 2869267432c3 |
15 | 1346a992a6d0 |
hex | 9988549ea3b |
10550675892795 has 8 divisors (see below), whose sum is σ = 16881081428496. Its totient is φ = 5627027142816.
The previous prime is 10550675892767. The next prime is 10550675892797. The reversal of 10550675892795 is 59729857605501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10550675892795 - 211 = 10550675890747 is a prime.
It is a super-2 number, since 2×105506758927952 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10550675892797) 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, 351689196412 + ... + 351689196441.
It is an arithmetic number, because the mean of its divisors is an integer number (2110135178562).
Almost surely, 210550675892795 is an apocalyptic number.
10550675892795 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10550675892795 is a deficient number, since it is larger than the sum of its proper divisors (6330405535701).
10550675892795 is an equidigital number, since it uses as much as digits as its factorization.
10550675892795 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703378392861.
The product of its (nonzero) digits is 238140000, while the sum is 69.
The spelling of 10550675892795 in words is "ten trillion, five hundred fifty billion, six hundred seventy-five million, eight hundred ninety-two thousand, seven hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •