Base | Representation |
---|---|
bin | 11000001110000001110000… |
… | …001010001111001101101110 |
3 | 111222010221011210112211010100 |
4 | 120032001300022033031232 |
5 | 102430133430043012000 |
6 | 1014313133340451530 |
7 | 31302414210642243 |
oct | 3016016012171556 |
9 | 458127153484110 |
10 | 106517070672750 |
11 | 30a376aa556131 |
12 | bb4387b549ba6 |
13 | 475869415c9aa |
14 | 1c4364d05d5ca |
15 | c4ab47d72a00 |
hex | 60e07028f36e |
106517070672750 has 96 divisors (see below), whose sum is σ = 288063447781824. Its totient is φ = 28400480318400.
The previous prime is 106517070672679. The next prime is 106517070672767. The reversal of 106517070672750 is 57276070715601.
106517070672750 is a `hidden beast` number, since 1 + 0 + 6 + 517 + 0 + 7 + 0 + 6 + 72 + 7 + 50 = 666.
It is a super-2 number, since 2×1065170706727502 (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 47 ways as a sum of consecutive naturals, for example, 12322024 + ... + 19101476.
It is an arithmetic number, because the mean of its divisors is an integer number (3000660914394).
Almost surely, 2106517070672750 is an apocalyptic number.
106517070672750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106517070672750 is an abundant number, since it is smaller than the sum of its proper divisors (181546377109074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106517070672750 is a wasteful number, since it uses less digits than its factorization.
106517070672750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6786459 (or 6786446 counting only the distinct ones).
The product of its (nonzero) digits is 4321800, while the sum is 54.
The spelling of 106517070672750 in words is "one hundred six trillion, five hundred seventeen billion, seventy million, six hundred seventy-two thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •