Base | Representation |
---|---|
bin | 101110110100000100… |
… | …0110000111110110101 |
3 | 100121111012112001011021 |
4 | 1131220020300332311 |
5 | 3121342013013203 |
6 | 114103344141141 |
7 | 10156155411553 |
oct | 1355010607665 |
9 | 317435461137 |
10 | 100531376053 |
11 | 396a9382869 |
12 | 175979077b1 |
13 | 963192bc44 |
14 | 4c19862bd3 |
15 | 2935bee5bd |
hex | 1768230fb5 |
100531376053 has 4 divisors (see below), whose sum is σ = 101057718528. Its totient is φ = 100005033580.
The previous prime is 100531376051. The next prime is 100531376081. The reversal of 100531376053 is 350673135001.
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 a cyclic number.
It is not a de Polignac number, because 100531376053 - 21 = 100531376051 is a prime.
It is a super-2 number, since 2×1005313760532 (a number of 23 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 (100531376051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 263170951 + ... + 263171332.
It is an arithmetic number, because the mean of its divisors is an integer number (25264429632).
Almost surely, 2100531376053 is an apocalyptic number.
It is an amenable number.
100531376053 is a deficient number, since it is larger than the sum of its proper divisors (526342475).
100531376053 is an equidigital number, since it uses as much as digits as its factorization.
100531376053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526342474.
The product of its (nonzero) digits is 28350, while the sum is 34.
The spelling of 100531376053 in words is "one hundred billion, five hundred thirty-one million, three hundred seventy-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •