Base | Representation |
---|---|
bin | 11000001101010000011000… |
… | …010000101100101000101101 |
3 | 111221221212100010202212122120 |
4 | 120031100120100230220231 |
5 | 102423301341412113230 |
6 | 1014232525020103153 |
7 | 31265526364516125 |
oct | 3015203020545055 |
9 | 457855303685576 |
10 | 106464056363565 |
11 | 30a17175339a6a |
12 | bb35545094ab9 |
13 | 4753695a68684 |
14 | 1c40c6027dc85 |
15 | c49593a5e310 |
hex | 60d41842ca2d |
106464056363565 has 16 divisors (see below), whose sum is σ = 174946341268608. Its totient is φ = 55246213031616.
The previous prime is 106464056363521. The next prime is 106464056363771. The reversal of 106464056363565 is 565363650464601.
It is not a de Polignac number, because 106464056363565 - 211 = 106464056361517 is a prime.
It is a super-2 number, since 2×1064640563635652 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106464056363499 and 106464056363508.
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, 95913563737 + ... + 95913564846.
It is an arithmetic number, because the mean of its divisors is an integer number (10934146329288).
Almost surely, 2106464056363565 is an apocalyptic number.
106464056363565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106464056363565 is a deficient number, since it is larger than the sum of its proper divisors (68482284905043).
106464056363565 is a wasteful number, since it uses less digits than its factorization.
106464056363565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191827128628.
The product of its (nonzero) digits is 139968000, while the sum is 60.
The spelling of 106464056363565 in words is "one hundred six trillion, four hundred sixty-four billion, fifty-six million, three hundred sixty-three thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •