Base | Representation |
---|---|
bin | 110010010111100011… |
… | …1101011100011010101 |
3 | 101100012012000100022001 |
4 | 1210233013223203111 |
5 | 3233010132144244 |
6 | 121405025235301 |
7 | 10546264664221 |
oct | 1445707534325 |
9 | 340165010261 |
10 | 108164724949 |
11 | 41966192876 |
12 | 18b68192b31 |
13 | a27a208b38 |
14 | 5341567781 |
15 | 2c30e225d4 |
hex | 192f1eb8d5 |
108164724949 has 4 divisors (see below), whose sum is σ = 108186908364. Its totient is φ = 108142541536.
The previous prime is 108164724901. The next prime is 108164724979. The reversal of 108164724949 is 949427461801.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 73987808049 + 34176916900 = 272007^2 + 184870^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-108164724949 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 108164724949.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108164724979) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11084392 + ... + 11094145.
It is an arithmetic number, because the mean of its divisors is an integer number (27046727091).
Almost surely, 2108164724949 is an apocalyptic number.
It is an amenable number.
108164724949 is a deficient number, since it is larger than the sum of its proper divisors (22183415).
108164724949 is an equidigital number, since it uses as much as digits as its factorization.
108164724949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22183414.
The product of its (nonzero) digits is 3483648, while the sum is 55.
The spelling of 108164724949 in words is "one hundred eight billion, one hundred sixty-four million, seven hundred twenty-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •