Base | Representation |
---|---|
bin | 110001011010011000… |
… | …1011101100010001111 |
3 | 101010220010121011210121 |
4 | 1202310301131202033 |
5 | 3214304143030030 |
6 | 120425222045411 |
7 | 10444361540524 |
oct | 1426461354217 |
9 | 333803534717 |
10 | 106112080015 |
11 | 410025592a7 |
12 | 18694879867 |
13 | a010b8b536 |
14 | 51c8ac714b |
15 | 2b60b1147a |
hex | 18b4c5d88f |
106112080015 has 4 divisors (see below), whose sum is σ = 127334496024. Its totient is φ = 84889664008.
The previous prime is 106112079971. The next prime is 106112080043. The reversal of 106112080015 is 510080211601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 510080211601 = 7141992.
It is a cyclic number.
It is not a de Polignac number, because 106112080015 - 29 = 106112079503 is a prime.
It is a super-2 number, since 2×1061120800152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10611207997 + ... + 10611208006.
It is an arithmetic number, because the mean of its divisors is an integer number (31833624006).
Almost surely, 2106112080015 is an apocalyptic number.
106112080015 is a deficient number, since it is larger than the sum of its proper divisors (21222416009).
106112080015 is an equidigital number, since it uses as much as digits as its factorization.
106112080015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21222416008.
The product of its (nonzero) digits is 480, while the sum is 25.
Adding to 106112080015 its reverse (510080211601), we get a palindrome (616192291616).
The spelling of 106112080015 in words is "one hundred six billion, one hundred twelve million, eighty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •