Base | Representation |
---|---|
bin | 11011010011101110110000… |
… | …011010110111010011001000 |
3 | 120202020202011122200122002212 |
4 | 123103232300122313103020 |
5 | 111220232202331032222 |
6 | 1103234341045444252 |
7 | 34204110350423123 |
oct | 3323566032672310 |
9 | 522222148618085 |
10 | 120103130330312 |
11 | 352a54a6a97858 |
12 | 1157895b410688 |
13 | 52028a462386c |
14 | 2193045b413ba |
15 | dd42585ca6e2 |
hex | 6d3bb06b74c8 |
120103130330312 has 8 divisors (see below), whose sum is σ = 225193369369350. Its totient is φ = 60051565165152.
The previous prime is 120103130330237. The next prime is 120103130330317. The reversal of 120103130330312 is 213033031301021.
It can be written as a sum of positive squares in only one way, i.e., 63722764883716 + 56380365446596 = 7982654^2 + 7508686^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-3 number, since 3×1201031303303123 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (120103130330317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7506445645637 + ... + 7506445645652.
Almost surely, 2120103130330312 is an apocalyptic number.
It is an amenable number.
120103130330312 is a deficient number, since it is larger than the sum of its proper divisors (105090239039038).
120103130330312 is a wasteful number, since it uses less digits than its factorization.
120103130330312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15012891291295 (or 15012891291291 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 120103130330312 its reverse (213033031301021), we get a palindrome (333136161631333).
The spelling of 120103130330312 in words is "one hundred twenty trillion, one hundred three billion, one hundred thirty million, three hundred thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •