Base | Representation |
---|---|
bin | 110001101101101111… |
… | …1001110011110000010 |
3 | 101012120101210202222212 |
4 | 1203123133032132002 |
5 | 3222121433024023 |
6 | 121013503502122 |
7 | 10466436502340 |
oct | 1433337163602 |
9 | 335511722885 |
10 | 106761611138 |
11 | 41306167686 |
12 | 188362b7942 |
13 | a0b5609c90 |
14 | 524b084990 |
15 | 2b9cb64e78 |
hex | 18db7ce782 |
106761611138 has 32 divisors (see below), whose sum is σ = 201682056576. Its totient is φ = 41253141888.
The previous prime is 106761611119. The next prime is 106761611153. The reversal of 106761611138 is 831116167601.
It is a super-2 number, since 2×1067616111382 (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 = 106761611095 and 106761611104.
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, 6813131 + ... + 6828782.
It is an arithmetic number, because the mean of its divisors is an integer number (6302564268).
Almost surely, 2106761611138 is an apocalyptic number.
106761611138 is a deficient number, since it is larger than the sum of its proper divisors (94920445438).
106761611138 is a wasteful number, since it uses less digits than its factorization.
106761611138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13641978.
The product of its (nonzero) digits is 36288, while the sum is 41.
Adding to 106761611138 its reverse (831116167601), we get a palindrome (937877778739).
The spelling of 106761611138 in words is "one hundred six billion, seven hundred sixty-one million, six hundred eleven thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •