Base | Representation |
---|---|
bin | 11000001101010110000011… |
… | …010101011101110000101111 |
3 | 111221222110001122210000000200 |
4 | 120031112003111131300233 |
5 | 102423401330310232032 |
6 | 1014235413255324543 |
7 | 31266133341423144 |
oct | 3015260325356057 |
9 | 457873048700020 |
10 | 106470147742767 |
11 | 30a19810803356 |
12 | bb36765080753 |
13 | 4754126a4a073 |
14 | 1c4127b2783cb |
15 | c497ed6e747c |
hex | 60d58355dc2f |
106470147742767 has 24 divisors (see below), whose sum is σ = 159257847159840. Its totient is φ = 68461637469120.
The previous prime is 106470147742703. The next prime is 106470147742817. The reversal of 106470147742767 is 767247741074601.
106470147742767 is a `hidden beast` number, since 1 + 0 + 6 + 4 + 7 + 0 + 147 + 7 + 427 + 67 = 666.
It is not a de Polignac number, because 106470147742767 - 26 = 106470147742703 is a prime.
It is a super-2 number, since 2×1064701477427672 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106470147742267) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 210673984 + ... + 211178757.
It is an arithmetic number, because the mean of its divisors is an integer number (6635743631660).
Almost surely, 2106470147742767 is an apocalyptic number.
106470147742767 is a deficient number, since it is larger than the sum of its proper divisors (52787699417073).
106470147742767 is a wasteful number, since it uses less digits than its factorization.
106470147742767 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 421853743 (or 421853740 counting only the distinct ones).
The product of its (nonzero) digits is 77446656, while the sum is 63.
The spelling of 106470147742767 in words is "one hundred six trillion, four hundred seventy billion, one hundred forty-seven million, seven hundred forty-two thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •