Base | Representation |
---|---|
bin | 110001001110110011… |
… | …1101011100101010001 |
3 | 101002220001200101110202 |
4 | 1202131213223211101 |
5 | 3213010222441040 |
6 | 120322504304545 |
7 | 10431634054004 |
oct | 1423547534521 |
9 | 332801611422 |
10 | 105723640145 |
11 | 40923269712 |
12 | 185a6772155 |
13 | 9c7b566966 |
14 | 518d29153b |
15 | 2b3b983015 |
hex | 189d9eb951 |
105723640145 has 8 divisors (see below), whose sum is σ = 127143573480. Its totient is φ = 84395441920.
The previous prime is 105723640133. The next prime is 105723640159. The reversal of 105723640145 is 541046327501.
It can be written as a sum of positive squares in 4 ways, for example, as 6478479121 + 99245161024 = 80489^2 + 315032^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105723640145 - 26 = 105723640081 is a prime.
It is a super-2 number, since 2×1057236401452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105723640099 and 105723640108.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22931240 + ... + 22935849.
It is an arithmetic number, because the mean of its divisors is an integer number (15892946685).
Almost surely, 2105723640145 is an apocalyptic number.
It is an amenable number.
105723640145 is a deficient number, since it is larger than the sum of its proper divisors (21419933335).
105723640145 is an equidigital number, since it uses as much as digits as its factorization.
105723640145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45867555.
The product of its (nonzero) digits is 100800, while the sum is 38.
Adding to 105723640145 its reverse (541046327501), we get a palindrome (646769967646).
The spelling of 105723640145 in words is "one hundred five billion, seven hundred twenty-three million, six hundred forty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •