Base | Representation |
---|---|
bin | 1001100011110100100110… |
… | …0111110010011001011101 |
3 | 1101012211210001210002100212 |
4 | 2120331021213302121131 |
5 | 2334203032123441000 |
6 | 34204410200102205 |
7 | 2133252610021241 |
oct | 230751147623135 |
9 | 41184701702325 |
10 | 10511020140125 |
11 | 339277593593a |
12 | 1219133464965 |
13 | 5b3253432a6b |
14 | 284a43b86421 |
15 | 133638292c35 |
hex | 98f499f265d |
10511020140125 has 16 divisors (see below), whose sum is σ = 13152364680000. Its totient is φ = 8386629224400.
The previous prime is 10511020140067. The next prime is 10511020140139. The reversal of 10511020140125 is 52104102011501.
It is a happy number.
It is not a de Polignac number, because 10511020140125 - 238 = 10236142233181 is a prime.
It is a super-2 number, since 2×105110201401252 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10511020140125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 110886875 + ... + 110981624.
It is an arithmetic number, because the mean of its divisors is an integer number (822022792500).
Almost surely, 210511020140125 is an apocalyptic number.
It is an amenable number.
10511020140125 is a deficient number, since it is larger than the sum of its proper divisors (2641344539875).
10511020140125 is an equidigital number, since it uses as much as digits as its factorization.
10511020140125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221868893 (or 221868883 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 23.
Adding to 10511020140125 its reverse (52104102011501), we get a palindrome (62615122151626).
The spelling of 10511020140125 in words is "ten trillion, five hundred eleven billion, twenty million, one hundred forty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •