Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …110011001110010110000011 |
3 | 111010102222210110012210100011 |
4 | 112300232200303032112003 |
5 | 101110112031120104111 |
6 | 552523455421405351 |
7 | 30041245424054230 |
oct | 2660564063162603 |
9 | 433388713183304 |
10 | 100105500550531 |
11 | 29995560352303 |
12 | b289149709857 |
13 | 43b1ba63ccac8 |
14 | 1aa11bc5d0787 |
15 | b88e91887021 |
hex | 5b0ba0cce583 |
100105500550531 has 8 divisors (see below), whose sum is σ = 114406539083264. Its totient is φ = 85804525202760.
The previous prime is 100105500550463. The next prime is 100105500550541. The reversal of 100105500550531 is 135055005501001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100105500550531 - 29 = 100105500550019 is a prime.
It is a super-2 number, since 2×1001055005505312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100105500550493 and 100105500550502.
It is not an unprimeable number, because it can be changed into a prime (100105500550541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12351165 + ... + 18781966.
It is an arithmetic number, because the mean of its divisors is an integer number (14300817385408).
Almost surely, 2100105500550531 is an apocalyptic number.
100105500550531 is a deficient number, since it is larger than the sum of its proper divisors (14301038532733).
100105500550531 is an equidigital number, since it uses as much as digits as its factorization.
100105500550531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31592481.
The product of its (nonzero) digits is 9375, while the sum is 31.
The spelling of 100105500550531 in words is "one hundred trillion, one hundred five billion, five hundred million, five hundred fifty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •