Base | Representation |
---|---|
bin | 101110110011011110… |
… | …0111101001100001001 |
3 | 100121102211010101121110 |
4 | 1131212330331030021 |
5 | 3121321421044423 |
6 | 114101354200533 |
7 | 10155524452140 |
oct | 1354674751411 |
9 | 317384111543 |
10 | 100511503113 |
11 | 39699139a4a |
12 | 17591123149 |
13 | 962a7915c8 |
14 | 4c16d6c757 |
15 | 29340c6193 |
hex | 1766f3d309 |
100511503113 has 16 divisors (see below), whose sum is σ = 153182314880. Its totient is φ = 57426921216.
The previous prime is 100511503087. The next prime is 100511503117. The reversal of 100511503113 is 311305115001.
It is not a de Polignac number, because 100511503113 - 213 = 100511494921 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100511503113.
It is not an unprimeable number, because it can be changed into a prime (100511503117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 190918 + ... + 487311.
It is an arithmetic number, because the mean of its divisors is an integer number (9573894680).
Almost surely, 2100511503113 is an apocalyptic number.
It is an amenable number.
100511503113 is a deficient number, since it is larger than the sum of its proper divisors (52670811767).
100511503113 is an equidigital number, since it uses as much as digits as its factorization.
100511503113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685296.
The product of its (nonzero) digits is 225, while the sum is 21.
Adding to 100511503113 its reverse (311305115001), we get a palindrome (411816618114).
The spelling of 100511503113 in words is "one hundred billion, five hundred eleven million, five hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •