Base | Representation |
---|---|
bin | 110001001101010101… |
… | …1110111011110010000 |
3 | 101002202122001000121121 |
4 | 1202122223313132100 |
5 | 3212410121441101 |
6 | 120313545132024 |
7 | 10430465425402 |
oct | 1423253673620 |
9 | 332678030547 |
10 | 105674405776 |
11 | 408a84a1155 |
12 | 1859218a014 |
13 | 9c712b8bb4 |
14 | 5186916b72 |
15 | 2b374aa0a1 |
hex | 189aaf7790 |
105674405776 has 45 divisors (see below), whose sum is σ = 206341148883. Its totient is φ = 52428257280.
The previous prime is 105674405773. The next prime is 105674405801. The reversal of 105674405776 is 677504476501.
It is a happy number.
The square root of 105674405776 is 325076.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 30598405776 + 75076000000 = 174924^2 + 274000^2 .
It is a super-2 number, since 2×1056744057762 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105674405773) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 235354800 + ... + 235355248.
Almost surely, 2105674405776 is an apocalyptic number.
105674405776 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
105674405776 is the 325076-th square number.
It is an amenable number.
105674405776 is a deficient number, since it is larger than the sum of its proper divisors (100666743107).
105674405776 is an frugal number, since it uses more digits than its factorization.
105674405776 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1268 (or 632 counting only the distinct ones).
The product of its (nonzero) digits is 4939200, while the sum is 52.
The spelling of 105674405776 in words is "one hundred five billion, six hundred seventy-four million, four hundred five thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •