Base | Representation |
---|---|
bin | 110001011111110111… |
… | …1000101110010100001 |
3 | 101011100221200200100022 |
4 | 1202333233011302201 |
5 | 3220143234222331 |
6 | 120455352203225 |
7 | 10452054105332 |
oct | 1427757056241 |
9 | 334327620308 |
10 | 106296007841 |
11 | 41097363a71 |
12 | 18726399515 |
13 | a04000917a |
14 | 52052c4289 |
15 | 2b71d4367b |
hex | 18bfbc5ca1 |
106296007841 has 4 divisors (see below), whose sum is σ = 107793134784. Its totient is φ = 104798880900.
The previous prime is 106296007823. The next prime is 106296007861. The reversal of 106296007841 is 148700692601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106296007841 is a prime.
It is a super-2 number, since 2×1062960078412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106296007792 and 106296007801.
It is not an unprimeable number, because it can be changed into a prime (106296007801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 748563365 + ... + 748563506.
It is an arithmetic number, because the mean of its divisors is an integer number (26948283696).
Almost surely, 2106296007841 is an apocalyptic number.
It is an amenable number.
106296007841 is a deficient number, since it is larger than the sum of its proper divisors (1497126943).
106296007841 is an equidigital number, since it uses as much as digits as its factorization.
106296007841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1497126942.
The product of its (nonzero) digits is 145152, while the sum is 44.
The spelling of 106296007841 in words is "one hundred six billion, two hundred ninety-six million, seven thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •