Base | Representation |
---|---|
bin | 10110110110011110001111… |
… | …101111111011001001110101 |
3 | 111011211201222021212110120101 |
4 | 112312132033233323021311 |
5 | 101133044204433322203 |
6 | 553425120223034101 |
7 | 30111624253334302 |
oct | 2666361757731165 |
9 | 434751867773511 |
10 | 100500351464053 |
11 | 2a027a613a9832 |
12 | b33178443b931 |
13 | 44101b10403c8 |
14 | 1ab63589a40a9 |
15 | b943a11ca41d |
hex | 5b678fbfb275 |
100500351464053 has 12 divisors (see below), whose sum is σ = 102729452962752. Its totient is φ = 98318652575000.
The previous prime is 100500351464033. The next prime is 100500351464059. The reversal of 100500351464053 is 350464153005001.
It is a de Polignac number, because none of the positive numbers 2k-100500351464053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100500351464059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5026573 + ... + 15042178.
It is an arithmetic number, because the mean of its divisors is an integer number (8560787746896).
Almost surely, 2100500351464053 is an apocalyptic number.
It is an amenable number.
100500351464053 is a deficient number, since it is larger than the sum of its proper divisors (2229101498699).
100500351464053 is an equidigital number, since it uses as much as digits as its factorization.
100500351464053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20071112 (or 20071065 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 100500351464053 in words is "one hundred trillion, five hundred billion, three hundred fifty-one million, four hundred sixty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •