Base | Representation |
---|---|
bin | 110010010100000001… |
… | …0010111000011100000 |
3 | 101022212220101220001202 |
4 | 1210220002113003200 |
5 | 3232234221433020 |
6 | 121345142220332 |
7 | 10543322624024 |
oct | 1445002270340 |
9 | 338786356052 |
10 | 108045889760 |
11 | 419050a7176 |
12 | 18b344246a8 |
13 | a25b6cc163 |
14 | 532d872384 |
15 | 2c2579be75 |
hex | 19280970e0 |
108045889760 has 48 divisors (see below), whose sum is σ = 255437582400. Its totient is φ = 43188020736.
The previous prime is 108045889733. The next prime is 108045889781. The reversal of 108045889760 is 67988540801.
It is a super-3 number, since 3×1080458897603 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 108045889696 and 108045889705.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7640 + ... + 464919.
It is an arithmetic number, because the mean of its divisors is an integer number (5321616300).
Almost surely, 2108045889760 is an apocalyptic number.
108045889760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
108045889760 is an abundant number, since it is smaller than the sum of its proper divisors (147391692640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108045889760 is a wasteful number, since it uses less digits than its factorization.
108045889760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474003 (or 473995 counting only the distinct ones).
The product of its (nonzero) digits is 3870720, while the sum is 56.
The spelling of 108045889760 in words is "one hundred eight billion, forty-five million, eight hundred eighty-nine thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •