Base | Representation |
---|---|
bin | 11000101000011010101010… |
… | …011110110001111000001100 |
3 | 112012120022000120102122111000 |
4 | 120220122222132301320030 |
5 | 103144341403441210202 |
6 | 1022222204543500300 |
7 | 31550423256146106 |
oct | 3050325236617014 |
9 | 465508016378430 |
10 | 108330525335052 |
11 | 31576799420739 |
12 | 101972218b7690 |
13 | 485a6a8a16727 |
14 | 1ca732270a576 |
15 | c7cdd3bdc91c |
hex | 6286aa7b1e0c |
108330525335052 has 48 divisors (see below), whose sum is σ = 280871094179200. Its totient is φ = 36108352400400.
The previous prime is 108330525335051. The next prime is 108330525335057. The reversal of 108330525335052 is 250533525033801.
108330525335052 is a `hidden beast` number, since 1 + 0 + 8 + 3 + 305 + 2 + 5 + 335 + 0 + 5 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 108330525334989 and 108330525335007.
It is not an unprimeable number, because it can be changed into a prime (108330525335051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23165074 + ... + 27445977.
Almost surely, 2108330525335052 is an apocalyptic number.
108330525335052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
108330525335052 is an abundant number, since it is smaller than the sum of its proper divisors (172540568844148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108330525335052 is a wasteful number, since it uses less digits than its factorization.
108330525335052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50630883 (or 50630875 counting only the distinct ones).
The product of its (nonzero) digits is 1620000, while the sum is 45.
The spelling of 108330525335052 in words is "one hundred eight trillion, three hundred thirty billion, five hundred twenty-five million, three hundred thirty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •