Base | Representation |
---|---|
bin | 110010011110100010… |
… | …1110110101001110000 |
3 | 101100210112002012200010 |
4 | 1210331011312221300 |
5 | 3234000134032102 |
6 | 121444201254520 |
7 | 10555142243451 |
oct | 1447505665160 |
9 | 340715065603 |
10 | 108399127152 |
11 | 41a765326a8 |
12 | 19012794440 |
13 | a2b6949a74 |
14 | 5364743128 |
15 | 2c467c4d6c |
hex | 193d176a70 |
108399127152 has 40 divisors (see below), whose sum is σ = 280696287760. Its totient is φ = 36047208960.
The previous prime is 108399127139. The next prime is 108399127183. The reversal of 108399127152 is 251721993801.
It is a happy number.
It is a super-2 number, since 2×1083991271522 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2661877 + ... + 2702292.
It is an arithmetic number, because the mean of its divisors is an integer number (7017407194).
Almost surely, 2108399127152 is an apocalyptic number.
108399127152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
108399127152 is an abundant number, since it is smaller than the sum of its proper divisors (172297160608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108399127152 is a wasteful number, since it uses less digits than its factorization.
108399127152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5364601 (or 5364595 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 48.
The spelling of 108399127152 in words is "one hundred eight billion, three hundred ninety-nine million, one hundred twenty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •