Base | Representation |
---|---|
bin | 10110101111111111111101… |
… | …011011100011110100010101 |
3 | 111010021012202212121202212111 |
4 | 112233333331123203310111 |
5 | 101103302143321124230 |
6 | 552444511414151021 |
7 | 30034525636056166 |
oct | 2657777533436425 |
9 | 433235685552774 |
10 | 100055515020565 |
11 | 2997633a872865 |
12 | b27b519652471 |
13 | 43aa26b658440 |
14 | 1a9c9d9b8976d |
15 | b87a183ee92a |
hex | 5afffd6e3d15 |
100055515020565 has 24 divisors (see below), whose sum is σ = 129535095551400. Its totient is φ = 73754482714368.
The previous prime is 100055515020529. The next prime is 100055515020581. The reversal of 100055515020565 is 565020515550001.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 55785468047089 + 44270046973476 = 7468967^2 + 6653574^2 .
It is not a de Polignac number, because 100055515020565 - 29 = 100055515020053 is a prime.
It is a super-2 number, since 2×1000555150205652 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17685411 + ... + 22646959.
It is an arithmetic number, because the mean of its divisors is an integer number (5397295647975).
Almost surely, 2100055515020565 is an apocalyptic number.
It is an amenable number.
100055515020565 is a deficient number, since it is larger than the sum of its proper divisors (29479580530835).
100055515020565 is an frugal number, since it uses more digits than its factorization.
100055515020565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4962681 (or 4962124 counting only the distinct ones).
The product of its (nonzero) digits is 187500, while the sum is 40.
The spelling of 100055515020565 in words is "one hundred trillion, fifty-five billion, five hundred fifteen million, twenty thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •