Base | Representation |
---|---|
bin | 1001100110000110010011… |
… | …0100010110110011111101 |
3 | 1101100120201210000000001210 |
4 | 2121201210310112303331 |
5 | 2340323132032004001 |
6 | 34234355140155033 |
7 | 2136136040635542 |
oct | 231414464266375 |
9 | 41316653000053 |
10 | 10550131125501 |
11 | 33a8315a85050 |
12 | 1224829698a79 |
13 | 5b6b47266b66 |
14 | 2868b4256bc9 |
15 | 134676bbcdd6 |
hex | 99864d16cfd |
10550131125501 has 32 divisors (see below), whose sum is σ = 15423554764800. Its totient is φ = 6361559899200.
The previous prime is 10550131125437. The next prime is 10550131125557. The reversal of 10550131125501 is 10552113105501.
It is not a de Polignac number, because 10550131125501 - 26 = 10550131125437 is a prime.
It is a super-2 number, since 2×105501311255012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10550131123501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 202966551 + ... + 203018523.
It is an arithmetic number, because the mean of its divisors is an integer number (481986086400).
Almost surely, 210550131125501 is an apocalyptic number.
10550131125501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10550131125501 is a deficient number, since it is larger than the sum of its proper divisors (4873423639299).
10550131125501 is a wasteful number, since it uses less digits than its factorization.
10550131125501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83097.
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 10550131125501 in words is "ten trillion, five hundred fifty billion, one hundred thirty-one million, one hundred twenty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •