Base | Representation |
---|---|
bin | 10111011111010010010001… |
… | …110110101101110011101000 |
3 | 111112202212021002201122212200 |
4 | 113133102101312231303220 |
5 | 102020022120103134422 |
6 | 1003413355000140200 |
7 | 30521353133323236 |
oct | 2737222166556350 |
9 | 445685232648780 |
10 | 103305000443112 |
11 | 2aa0944a65a066 |
12 | b70524b767660 |
13 | 4584809759c10 |
14 | 1b71dbadc5956 |
15 | be23006b52ac |
hex | 5df491dadce8 |
103305000443112 has 96 divisors (see below), whose sum is σ = 301309340011680. Its totient is φ = 31785828140160.
The previous prime is 103305000443093. The next prime is 103305000443171. The reversal of 103305000443112 is 211344000503301.
It is a happy number.
103305000443112 is a `hidden beast` number, since 1 + 0 + 3 + 3 + 0 + 500 + 0 + 4 + 43 + 112 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 100414287 + ... + 101437857.
It is an arithmetic number, because the mean of its divisors is an integer number (3138638958455).
Almost surely, 2103305000443112 is an apocalyptic number.
103305000443112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103305000443112 is an abundant number, since it is smaller than the sum of its proper divisors (198004339568568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103305000443112 is a wasteful number, since it uses less digits than its factorization.
103305000443112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1131423 (or 1131416 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 103305000443112 its reverse (211344000503301), we get a palindrome (314649000946413).
The spelling of 103305000443112 in words is "one hundred three trillion, three hundred five billion, four hundred forty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •