Base | Representation |
---|---|
bin | 110001010010011000… |
… | …1100011011011011100 |
3 | 101010012102112110200210 |
4 | 1202210301203123130 |
5 | 3213231434344300 |
6 | 120342433052420 |
7 | 10434622224330 |
oct | 1424461433334 |
9 | 333172473623 |
10 | 105843668700 |
11 | 40984a9a970 |
12 | 1861a9b7110 |
13 | 9c9a3a0883 |
14 | 51a11b77c0 |
15 | 2b47292050 |
hex | 18a4c636dc |
105843668700 has 144 divisors (see below), whose sum is σ = 381807062784. Its totient is φ = 21993484800.
The previous prime is 105843668659. The next prime is 105843668701. The reversal of 105843668700 is 7866348501.
It is a super-2 number, since 2×1058436687002 (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 105843668700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105843668701) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2267889 + ... + 2314088.
It is an arithmetic number, because the mean of its divisors is an integer number (2651437936).
Almost surely, 2105843668700 is an apocalyptic number.
105843668700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105843668700 is an abundant number, since it is smaller than the sum of its proper divisors (275963394084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105843668700 is a wasteful number, since it uses less digits than its factorization.
105843668700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4582012 (or 4582005 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 48.
The spelling of 105843668700 in words is "one hundred five billion, eight hundred forty-three million, six hundred sixty-eight thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •