Base | Representation |
---|---|
bin | 110001001001110111… |
… | …0011000110111100000 |
3 | 101002110111022000100011 |
4 | 1202103232120313200 |
5 | 3212140223020321 |
6 | 120254214134304 |
7 | 10424550006511 |
oct | 1422356306740 |
9 | 332414260304 |
10 | 105557626336 |
11 | 4084858a018 |
12 | 1855b051394 |
13 | 9c5304bb36 |
14 | 51751d8a08 |
15 | 2b2c0ddae1 |
hex | 1893b98de0 |
105557626336 has 24 divisors (see below), whose sum is σ = 218754292680. Its totient is φ = 50000980608.
The previous prime is 105557626319. The next prime is 105557626337. The reversal of 105557626336 is 633626755501.
It is a super-2 number, since 2×1055576263362 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105557626336.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105557626337) 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, 86806651 + ... + 86807866.
It is an arithmetic number, because the mean of its divisors is an integer number (9114762195).
Almost surely, 2105557626336 is an apocalyptic number.
105557626336 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
105557626336 is an abundant number, since it is smaller than the sum of its proper divisors (113196666344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105557626336 is a wasteful number, since it uses less digits than its factorization.
105557626336 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173614546 (or 173614538 counting only the distinct ones).
The product of its (nonzero) digits is 3402000, while the sum is 49.
The spelling of 105557626336 in words is "one hundred five billion, five hundred fifty-seven million, six hundred twenty-six thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •