Base | Representation |
---|---|
bin | 1011111110111… |
… | …01000010101001 |
3 | 21000010221122212 |
4 | 11333131002221 |
5 | 201213120410 |
6 | 13550254505 |
7 | 2330256350 |
oct | 577350251 |
9 | 230127585 |
10 | 100520105 |
11 | 51817274 |
12 | 297b7435 |
13 | 17a9646a |
14 | d4c8997 |
15 | 8c58b05 |
hex | 5fdd0a9 |
100520105 has 8 divisors (see below), whose sum is σ = 137856192. Its totient is φ = 68928048.
The previous prime is 100520081. The next prime is 100520107. The reversal of 100520105 is 501025001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100520105 - 218 = 100257961 is a prime.
It is a super-3 number, since 3×1005201053 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100520105.
It is not an unprimeable number, because it can be changed into a prime (100520107) 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, 1435967 + ... + 1436036.
It is an arithmetic number, because the mean of its divisors is an integer number (17232024).
Almost surely, 2100520105 is an apocalyptic number.
It is an amenable number.
100520105 is a deficient number, since it is larger than the sum of its proper divisors (37336087).
100520105 is an equidigital number, since it uses as much as digits as its factorization.
100520105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2872015.
The product of its (nonzero) digits is 50, while the sum is 14.
The square root of 100520105 is about 10025.9715239971. The cubic root of 100520105 is about 464.9621967958.
Adding to 100520105 its reverse (501025001), we get a palindrome (601545106).
The spelling of 100520105 in words is "one hundred million, five hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •