Base | Representation |
---|---|
bin | 110010100101110001… |
… | …0101011100101110001 |
3 | 101101102102021022221012 |
4 | 1211023202223211301 |
5 | 3234444220040131 |
6 | 121524221440305 |
7 | 10564145031452 |
oct | 1451342534561 |
9 | 341372238835 |
10 | 108641565041 |
11 | 42090370899 |
12 | 1907ba10095 |
13 | a324c42439 |
14 | 5388a11129 |
15 | 2c5cc1352b |
hex | 194b8ab971 |
108641565041 has 16 divisors (see below), whose sum is σ = 110654594640. Its totient is φ = 106643589120.
The previous prime is 108641565017. The next prime is 108641565059. The reversal of 108641565041 is 140565146801.
It can be written as a sum of positive squares in 8 ways, for example, as 35070427441 + 73571137600 = 187271^2 + 271240^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-108641565041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 108641565041.
It is not an unprimeable number, because it can be changed into a prime (108641565091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23817401 + ... + 23821961.
It is an arithmetic number, because the mean of its divisors is an integer number (6915912165).
Almost surely, 2108641565041 is an apocalyptic number.
It is an amenable number.
108641565041 is a deficient number, since it is larger than the sum of its proper divisors (2013029599).
108641565041 is a wasteful number, since it uses less digits than its factorization.
108641565041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6116.
The product of its (nonzero) digits is 115200, while the sum is 41.
The spelling of 108641565041 in words is "one hundred eight billion, six hundred forty-one million, five hundred sixty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •