Base | Representation |
---|---|
bin | 11000101000000001111101… |
… | …110110011100001010011110 |
3 | 112012110202120110001102001012 |
4 | 120220001331312130022132 |
5 | 103143423101212242240 |
6 | 1022202101314415222 |
7 | 31545464152031363 |
oct | 3050017566341236 |
9 | 465422513042035 |
10 | 108304006759070 |
11 | 31566520377041 |
12 | 10192060891512 |
13 | 48580409b5a55 |
14 | 1ca5d287c646a |
15 | c7c380a51b65 |
hex | 62807dd9c29e |
108304006759070 has 32 divisors (see below), whose sum is σ = 203433282561600. Its totient is φ = 41435996405760.
The previous prime is 108304006759057. The next prime is 108304006759073. The reversal of 108304006759070 is 70957600403801.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108304006759073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7050851 + ... + 16319390.
It is an arithmetic number, because the mean of its divisors is an integer number (6357290080050).
Almost surely, 2108304006759070 is an apocalyptic number.
108304006759070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
108304006759070 is a deficient number, since it is larger than the sum of its proper divisors (95129275802530).
108304006759070 is a wasteful number, since it uses less digits than its factorization.
108304006759070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23390420.
The product of its (nonzero) digits is 1270080, while the sum is 50.
The spelling of 108304006759070 in words is "one hundred eight trillion, three hundred four billion, six million, seven hundred fifty-nine thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •