Base | Representation |
---|---|
bin | 110010011001111000… |
… | …1100010110001111101 |
3 | 101100101121221101000102 |
4 | 1210303301202301331 |
5 | 3233140124323213 |
6 | 121420455010445 |
7 | 10551233454341 |
oct | 1446361426175 |
9 | 340347841012 |
10 | 108242807933 |
11 | 419a6274767 |
12 | 18b8a369a25 |
13 | a2904477a0 |
14 | 534ba91621 |
15 | 2c37be8158 |
hex | 1933c62c7d |
108242807933 has 8 divisors (see below), whose sum is σ = 116634801528. Its totient is φ = 99860189184.
The previous prime is 108242807867. The next prime is 108242807941. The reversal of 108242807933 is 339708242801.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 109035364 + 108133772569 = 10442^2 + 328837^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 108242807933 - 228 = 107974372477 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 (108242807963) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2319716 + ... + 2365917.
It is an arithmetic number, because the mean of its divisors is an integer number (14579350191).
Almost surely, 2108242807933 is an apocalyptic number.
108242807933 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
108242807933 is a deficient number, since it is larger than the sum of its proper divisors (8391993595).
108242807933 is a wasteful number, since it uses less digits than its factorization.
108242807933 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4687423.
The product of its (nonzero) digits is 580608, while the sum is 47.
The spelling of 108242807933 in words is "one hundred eight billion, two hundred forty-two million, eight hundred seven thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •