Base | Representation |
---|---|
bin | 110000001101101111… |
… | …0010001010011100000 |
3 | 100220020220000211200212 |
4 | 1200123132101103200 |
5 | 3144022233311021 |
6 | 115322104233252 |
7 | 10323551425124 |
oct | 1403336212340 |
9 | 326226024625 |
10 | 103540135136 |
11 | 3aa02786019 |
12 | 1809746b828 |
13 | 99c108c269 |
14 | 50232a9584 |
15 | 2a5ee2385b |
hex | 181b7914e0 |
103540135136 has 12 divisors (see below), whose sum is σ = 203844641112. Its totient is φ = 51770067552.
The previous prime is 103540135099. The next prime is 103540135177. The reversal of 103540135136 is 631531045301.
It is a super-3 number, since 3×1035401351363 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 3235629223 = 103540135136 / (1 + 0 + 3 + 5 + 4 + 0 + 1 + 3 + 5 + 1 + 3 + 6).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1617814580 + ... + 1617814643.
It is an arithmetic number, because the mean of its divisors is an integer number (16987053426).
Almost surely, 2103540135136 is an apocalyptic number.
103540135136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
103540135136 is a deficient number, since it is larger than the sum of its proper divisors (100304505976).
103540135136 is an equidigital number, since it uses as much as digits as its factorization.
103540135136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3235629233 (or 3235629225 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 103540135136 in words is "one hundred three billion, five hundred forty million, one hundred thirty-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •