Base | Representation |
---|---|
bin | 110010101111110110… |
… | …1010001110000011101 |
3 | 101102021222212212121001 |
4 | 1211133231101300131 |
5 | 3241142322342013 |
6 | 122021545110301 |
7 | 10605423520315 |
oct | 1453755216035 |
9 | 342258785531 |
10 | 108979887133 |
11 | 4224433a227 |
12 | 19155188391 |
13 | a37a06a120 |
14 | 53bb91c445 |
15 | 2c7c791ddd |
hex | 195fb51c1d |
108979887133 has 4 divisors (see below), whose sum is σ = 117362955388. Its totient is φ = 100596818880.
The previous prime is 108979887119. The next prime is 108979887139. The reversal of 108979887133 is 331788979801.
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 25124469049 + 83855418084 = 158507^2 + 289578^2 .
It is a cyclic number.
It is not a de Polignac number, because 108979887133 - 229 = 108443016221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108979887139) 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, 4191534108 + ... + 4191534133.
It is an arithmetic number, because the mean of its divisors is an integer number (29340738847).
Almost surely, 2108979887133 is an apocalyptic number.
108979887133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
108979887133 is a deficient number, since it is larger than the sum of its proper divisors (8383068255).
108979887133 is an equidigital number, since it uses as much as digits as its factorization.
108979887133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8383068254.
The product of its (nonzero) digits is 18289152, while the sum is 64.
The spelling of 108979887133 in words is "one hundred eight billion, nine hundred seventy-nine million, eight hundred eighty-seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •