Base | Representation |
---|---|
bin | 110001101110011110… |
… | …1101001111011100001 |
3 | 101012122010101102010020 |
4 | 1203130331221323201 |
5 | 3222144302141103 |
6 | 121020150224053 |
7 | 10500160061436 |
oct | 1433475517341 |
9 | 335563342106 |
10 | 106786365153 |
11 | 41319134746 |
12 | 18842655029 |
13 | a0ba796220 |
14 | 5250489b8d |
15 | 2b9ee04753 |
hex | 18dcf69ee1 |
106786365153 has 16 divisors (see below), whose sum is σ = 154691214720. Its totient is φ = 65133137664.
The previous prime is 106786365083. The next prime is 106786365157. The reversal of 106786365153 is 351563687601.
It is a happy number.
It is not a de Polignac number, because 106786365153 - 28 = 106786364897 is a prime.
It is a super-2 number, since 2×1067863651532 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 106786365096 and 106786365105.
It is not an unprimeable number, because it can be changed into a prime (106786365157) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12111133 + ... + 12119946.
It is an arithmetic number, because the mean of its divisors is an integer number (9668200920).
Almost surely, 2106786365153 is an apocalyptic number.
106786365153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
106786365153 is a deficient number, since it is larger than the sum of its proper divisors (47904849567).
106786365153 is a wasteful number, since it uses less digits than its factorization.
106786365153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24231208.
The product of its (nonzero) digits is 2721600, while the sum is 51.
The spelling of 106786365153 in words is "one hundred six billion, seven hundred eighty-six million, three hundred sixty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •