Base | Representation |
---|---|
bin | 10111100010010111010000… |
… | …100010111101001000110000 |
3 | 111120112002012021001011001211 |
4 | 113202113100202331020300 |
5 | 102032003300420001021 |
6 | 1004054454242205504 |
7 | 30542551336602052 |
oct | 2742272042751060 |
9 | 446462167034054 |
10 | 103516505625136 |
11 | 2aa9011583485a |
12 | b73a238353894 |
13 | 459b7455513b6 |
14 | 1b7c3230bb8d2 |
15 | be7a7dc173e1 |
hex | 5e25d08bd230 |
103516505625136 has 80 divisors (see below), whose sum is σ = 208132028697600. Its totient is φ = 49843826993664.
The previous prime is 103516505625133. The next prime is 103516505625229. The reversal of 103516505625136 is 631526505615301.
It is a self number, because there is not a number n which added to its sum of digits gives 103516505625136.
It is not an unprimeable number, because it can be changed into a prime (103516505625133) 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, 20751205 + ... + 25251643.
It is an arithmetic number, because the mean of its divisors is an integer number (2601650358720).
Almost surely, 2103516505625136 is an apocalyptic number.
103516505625136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
103516505625136 is an abundant number, since it is smaller than the sum of its proper divisors (104615523072464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103516505625136 is a wasteful number, since it uses less digits than its factorization.
103516505625136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4500986 (or 4500980 counting only the distinct ones).
The product of its (nonzero) digits is 2430000, while the sum is 49.
The spelling of 103516505625136 in words is "one hundred three trillion, five hundred sixteen billion, five hundred five million, six hundred twenty-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •