Base | Representation |
---|---|
bin | 11000001010100001110111… |
… | …000011010100101000011001 |
3 | 111221021221122201202101211210 |
4 | 120022201313003110220121 |
5 | 102412214104020204430 |
6 | 1014010454412013333 |
7 | 31246143624030660 |
oct | 3012416703245031 |
9 | 457257581671753 |
10 | 106276668131865 |
11 | 30954755595a80 |
12 | bb05169161249 |
13 | 473bb0156a2ba |
14 | 1c35b65147dd7 |
15 | c447779002b0 |
hex | 60a8770d4a19 |
106276668131865 has 64 divisors (see below), whose sum is σ = 212004360529920. Its totient is φ = 44166278922240.
The previous prime is 106276668131839. The next prime is 106276668131903. The reversal of 106276668131865 is 568131866672601.
It is not a de Polignac number, because 106276668131865 - 214 = 106276668115481 is a prime.
It is a super-2 number, since 2×1062766681318652 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106276668131796 and 106276668131805.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 82505881 + ... + 83784089.
It is an arithmetic number, because the mean of its divisors is an integer number (3312568133280).
Almost surely, 2106276668131865 is an apocalyptic number.
106276668131865 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106276668131865 is a deficient number, since it is larger than the sum of its proper divisors (105727692398055).
106276668131865 is a wasteful number, since it uses less digits than its factorization.
106276668131865 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1350222.
The product of its (nonzero) digits is 104509440, while the sum is 66.
The spelling of 106276668131865 in words is "one hundred six trillion, two hundred seventy-six billion, six hundred sixty-eight million, one hundred thirty-one thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •