Base | Representation |
---|---|
bin | 10111111111111111010000… |
… | …110101111110101100001100 |
3 | 111211201201000000120101121110 |
4 | 113333333100311332230030 |
5 | 102313332130212014130 |
6 | 1012254022503132020 |
7 | 31142622004653540 |
oct | 2777772065765414 |
9 | 454651000511543 |
10 | 105552325110540 |
11 | 306a5542866140 |
12 | ba088b8144010 |
13 | 46b8706a22439 |
14 | 1c0ca8cc35a20 |
15 | c309d169aab0 |
hex | 5fffd0d7eb0c |
105552325110540 has 288 divisors, whose sum is σ = 391423487261184. Its totient is φ = 20642776842240.
The previous prime is 105552325110509. The next prime is 105552325110599. The reversal of 105552325110540 is 45011523255501.
It is a super-2 number, since 2×1055523251105402 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 38192197 + ... + 40862556.
It is an arithmetic number, because the mean of its divisors is an integer number (1359109330768).
Almost surely, 2105552325110540 is an apocalyptic number.
105552325110540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105552325110540 is an abundant number, since it is smaller than the sum of its proper divisors (285871162150644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105552325110540 is a wasteful number, since it uses less digits than its factorization.
105552325110540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79054817 (or 79054798 counting only the distinct ones).
The product of its (nonzero) digits is 150000, while the sum is 39.
The spelling of 105552325110540 in words is "one hundred five trillion, five hundred fifty-two billion, three hundred twenty-five million, one hundred ten thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •