Base | Representation |
---|---|
bin | 110001001000011110… |
… | …1000010101000010000 |
3 | 101002100020211001020222 |
4 | 1202100331002220100 |
5 | 3212041322321020 |
6 | 120245433452212 |
7 | 10423443566462 |
oct | 1422075025020 |
9 | 332306731228 |
10 | 105511135760 |
11 | 40824315a58 |
12 | 18547571068 |
13 | 9c46521c14 |
14 | 516cd76132 |
15 | 2b27ea8b25 |
hex | 1890f42a10 |
105511135760 has 40 divisors (see below), whose sum is σ = 245561116416. Its totient is φ = 42161834880.
The previous prime is 105511135747. The next prime is 105511135771. The reversal of 105511135760 is 67531115501.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-3 number, since 3×1055111357603 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 105511135760.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 586154 + ... + 744713.
Almost surely, 2105511135760 is an apocalyptic number.
105511135760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105511135760 is an abundant number, since it is smaller than the sum of its proper divisors (140049980656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105511135760 is a wasteful number, since it uses less digits than its factorization.
105511135760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1331871 (or 1331865 counting only the distinct ones).
The product of its (nonzero) digits is 15750, while the sum is 35.
The spelling of 105511135760 in words is "one hundred five billion, five hundred eleven million, one hundred thirty-five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •