Base | Representation |
---|---|
bin | 10110110110100011100001… |
… | …000001100001110010110001 |
3 | 111011212021120122101220101121 |
4 | 112312203201001201302301 |
5 | 101133142302030004221 |
6 | 553431453521102241 |
7 | 30112214423161264 |
oct | 2666434101416261 |
9 | 434767518356347 |
10 | 100506010000561 |
11 | 2a02a3a5505a90 |
12 | b3328a3487981 |
13 | 44108a3451669 |
14 | 1ab67342c8cdb |
15 | b945d2d63a41 |
hex | 5b68e1061cb1 |
100506010000561 has 16 divisors (see below), whose sum is σ = 111120799405248. Its totient is φ = 90145716998400.
The previous prime is 100506010000447. The next prime is 100506010000577. The reversal of 100506010000561 is 165000010605001.
It is a cyclic number.
It is not a de Polignac number, because 100506010000561 - 227 = 100505875782833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100506010030561) 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, 204333420 + ... + 204824701.
It is an arithmetic number, because the mean of its divisors is an integer number (6945049962828).
Almost surely, 2100506010000561 is an apocalyptic number.
100506010000561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100506010000561 is a deficient number, since it is larger than the sum of its proper divisors (10614789404687).
100506010000561 is a wasteful number, since it uses less digits than its factorization.
100506010000561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409158432.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 100506010000561 its reverse (165000010605001), we get a palindrome (265506020605562).
The spelling of 100506010000561 in words is "one hundred trillion, five hundred six billion, ten million, five hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •