Base | Representation |
---|---|
bin | 10111011100100110001100… |
… | …101100010000010110010000 |
3 | 111112010012100010221212100101 |
4 | 113130212030230100112100 |
5 | 102004010212414034300 |
6 | 1003152440233102144 |
7 | 30502122302335513 |
oct | 2734461454202620 |
9 | 445105303855311 |
10 | 103120230221200 |
11 | 2a948053691625 |
12 | b695484557954 |
13 | 457027176906a |
14 | 1b6708d85cd7a |
15 | bdc5d92e2b6a |
hex | 5dc98cb10590 |
103120230221200 has 60 divisors (see below), whose sum is σ = 247761948939988. Its totient is φ = 41245495488000.
The previous prime is 103120230221167. The next prime is 103120230221207. The reversal of 103120230221200 is 2122032021301.
It can be written as a sum of positive squares in 6 ways, for example, as 3954004987024 + 99166225234176 = 1988468^2 + 9958224^2 .
It is not an unprimeable number, because it can be changed into a prime (103120230221207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1746027 + ... + 14466826.
Almost surely, 2103120230221200 is an apocalyptic number.
103120230221200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103120230221200 is an abundant number, since it is smaller than the sum of its proper divisors (144641718718788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103120230221200 is a wasteful number, since it uses less digits than its factorization.
103120230221200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16228772 (or 16228761 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 103120230221200 its reverse (2122032021301), we get a palindrome (105242262242501).
The spelling of 103120230221200 in words is "one hundred three trillion, one hundred twenty billion, two hundred thirty million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •