Base | Representation |
---|---|
bin | 110010100001011011… |
… | …1101000111010011111 |
3 | 101101001021111010020122 |
4 | 1211002313220322133 |
5 | 3234144443023114 |
6 | 121501543105155 |
7 | 10560430220600 |
oct | 1450267507237 |
9 | 341037433218 |
10 | 108496064159 |
11 | 4201622192a |
12 | 1903b1421bb |
13 | a300a5a342 |
14 | 5373577da7 |
15 | 2c50071e8e |
hex | 1942de8e9f |
108496064159 has 12 divisors (see below), whose sum is σ = 128895022944. Its totient is φ = 91017972864.
The previous prime is 108496064153. The next prime is 108496064161. The reversal of 108496064159 is 951460694801.
It is not a de Polignac number, because 108496064159 - 24 = 108496064143 is a prime.
It is a super-3 number, since 3×1084960641593 (a number of 34 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
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 108496064159.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108496064153) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23553074 + ... + 23557679.
It is an arithmetic number, because the mean of its divisors is an integer number (10741251912).
Almost surely, 2108496064159 is an apocalyptic number.
108496064159 is a deficient number, since it is larger than the sum of its proper divisors (20398958785).
108496064159 is an equidigital number, since it uses as much as digits as its factorization.
108496064159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47110814 (or 47110807 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 53.
The spelling of 108496064159 in words is "one hundred eight billion, four hundred ninety-six million, sixty-four thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •