Base | Representation |
---|---|
bin | 101111001101001010… |
… | …1111110111111110111 |
3 | 100200122220111122022120 |
4 | 1132122111332333313 |
5 | 3130103131432020 |
6 | 114323114131023 |
7 | 10216064151666 |
oct | 1363225767767 |
9 | 320586448276 |
10 | 101373702135 |
11 | 39aa08a2922 |
12 | 17791a20a73 |
13 | 97372b1344 |
14 | 4c99688ddd |
15 | 2984b37740 |
hex | 179a57eff7 |
101373702135 has 16 divisors (see below), whose sum is σ = 162232745184. Its totient is φ = 54054367232.
The previous prime is 101373702083. The next prime is 101373702163. The reversal of 101373702135 is 531207373101.
It is a cyclic number.
It is not a de Polignac number, because 101373702135 - 28 = 101373701879 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101373702096 and 101373702105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 653022 + ... + 793211.
It is an arithmetic number, because the mean of its divisors is an integer number (10139546574).
Almost surely, 2101373702135 is an apocalyptic number.
101373702135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
101373702135 is a deficient number, since it is larger than the sum of its proper divisors (60859043049).
101373702135 is a wasteful number, since it uses less digits than its factorization.
101373702135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1450914.
The product of its (nonzero) digits is 13230, while the sum is 33.
The spelling of 101373702135 in words is "one hundred one billion, three hundred seventy-three million, seven hundred two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •