Base | Representation |
---|---|
bin | 110001100100001000… |
… | …1111101100001101001 |
3 | 101011201221110001210221 |
4 | 1203020101331201221 |
5 | 3220441434214021 |
6 | 120521513010041 |
7 | 10455444455350 |
oct | 1431021754151 |
9 | 334657401727 |
10 | 106439366761 |
11 | 4116027a712 |
12 | 187663b3921 |
13 | a063921330 |
14 | 521a360997 |
15 | 2b7e710241 |
hex | 18c847d869 |
106439366761 has 32 divisors (see below), whose sum is σ = 132043161600. Its totient is φ = 83549309760.
The previous prime is 106439366753. The next prime is 106439366771. The reversal of 106439366761 is 167663934601.
It is a happy number.
It is not a de Polignac number, because 106439366761 - 23 = 106439366753 is a prime.
It is a super-2 number, since 2×1064393667612 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106439366699 and 106439366708.
It is not an unprimeable number, because it can be changed into a prime (106439366701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5884950 + ... + 5903008.
It is an arithmetic number, because the mean of its divisors is an integer number (4126348800).
Almost surely, 2106439366761 is an apocalyptic number.
It is an amenable number.
106439366761 is a deficient number, since it is larger than the sum of its proper divisors (25603794839).
106439366761 is a wasteful number, since it uses less digits than its factorization.
106439366761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18589.
The product of its (nonzero) digits is 2939328, while the sum is 52.
The spelling of 106439366761 in words is "one hundred six billion, four hundred thirty-nine million, three hundred sixty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •