Base | Representation |
---|---|
bin | 10111011111100011010100… |
… | …100111001000010101010000 |
3 | 111112211121111110010201101011 |
4 | 113133203110213020111100 |
5 | 102020322104334100422 |
6 | 1003430022513420304 |
7 | 30522601462461064 |
oct | 2737432447102520 |
9 | 445747443121334 |
10 | 103323300300112 |
11 | 2aa16190428522 |
12 | b7088b826a694 |
13 | 4586464b38179 |
14 | 1b72c35589aa4 |
15 | be2a22050077 |
hex | 5df8d49c8550 |
103323300300112 has 80 divisors (see below), whose sum is σ = 217232339544000. Its totient is φ = 47453996178432.
The previous prime is 103323300300071. The next prime is 103323300300113. The reversal of 103323300300112 is 211003003323301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103323300300113) 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, 38147287 + ... + 40765942.
It is an arithmetic number, because the mean of its divisors is an integer number (2715404244300).
Almost surely, 2103323300300112 is an apocalyptic number.
It is an amenable number.
103323300300112 is an abundant number, since it is smaller than the sum of its proper divisors (113909039243888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103323300300112 is a wasteful number, since it uses less digits than its factorization.
103323300300112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78913388 (or 78913382 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 103323300300112 its reverse (211003003323301), we get a palindrome (314326303623413).
The spelling of 103323300300112 in words is "one hundred three trillion, three hundred twenty-three billion, three hundred million, three hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •