Base | Representation |
---|---|
bin | 110001001000100110… |
… | …1100010100010100000 |
3 | 101002100112221210001110 |
4 | 1202101031202202200 |
5 | 3212043424221033 |
6 | 120250110303320 |
7 | 10423525422024 |
oct | 1422115424240 |
9 | 332315853043 |
10 | 105515460768 |
11 | 408267aa443 |
12 | 18548ab7b40 |
13 | 9c473a76b3 |
14 | 516d780384 |
15 | 2b28560363 |
hex | 18913628a0 |
105515460768 has 24 divisors (see below), whose sum is σ = 276978084768. Its totient is φ = 35171820224.
The previous prime is 105515460751. The next prime is 105515460797. The reversal of 105515460768 is 867064515501.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-4 number, since 4×1055154607684 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (48).
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 3 ways as a sum of consecutive naturals, for example, 549559596 + ... + 549559787.
It is an arithmetic number, because the mean of its divisors is an integer number (11540753532).
Almost surely, 2105515460768 is an apocalyptic number.
It is an amenable number.
105515460768 is an abundant number, since it is smaller than the sum of its proper divisors (171462624000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105515460768 is a wasteful number, since it uses less digits than its factorization.
105515460768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1099119396 (or 1099119388 counting only the distinct ones).
The product of its (nonzero) digits is 1008000, while the sum is 48.
The spelling of 105515460768 in words is "one hundred five billion, five hundred fifteen million, four hundred sixty thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •