Base | Representation |
---|---|
bin | 101110110001010110… |
… | …1100010100100011101 |
3 | 100121020212020121002001 |
4 | 1131202231202210131 |
5 | 3121200212244203 |
6 | 114050333202301 |
7 | 10154001625435 |
oct | 1354255424435 |
9 | 317225217061 |
10 | 100440353053 |
11 | 39661a62947 |
12 | 17571330391 |
13 | 9618b0c491 |
14 | 4c0b72b2c5 |
15 | 292cc1e91d |
hex | 1762b6291d |
100440353053 has 8 divisors (see below), whose sum is σ = 102473227008. Its totient is φ = 98412581904.
The previous prime is 100440353047. The next prime is 100440353081. The reversal of 100440353053 is 350353044001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-100440353053 is a prime.
It is a super-2 number, since 2×1004403530532 (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 (100440353023) 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 7 ways as a sum of consecutive naturals, for example, 1235925 + ... + 1314682.
It is an arithmetic number, because the mean of its divisors is an integer number (12809153376).
Almost surely, 2100440353053 is an apocalyptic number.
It is an amenable number.
100440353053 is a deficient number, since it is larger than the sum of its proper divisors (2032873955).
100440353053 is an equidigital number, since it uses as much as digits as its factorization.
100440353053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2551403.
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 100440353053 its reverse (350353044001), we get a palindrome (450793397054).
The spelling of 100440353053 in words is "one hundred billion, four hundred forty million, three hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •