Base | Representation |
---|---|
bin | 11011010100010010010100… |
… | …110101011100110010110101 |
3 | 120202101101202022111211102222 |
4 | 123110102110311130302311 |
5 | 111221343411443241003 |
6 | 1103304054515012125 |
7 | 34206631651345103 |
oct | 3324222465346265 |
9 | 522341668454388 |
10 | 120141322243253 |
11 | 3530a715368273 |
12 | 1158423989a045 |
13 | 520637cc1410c |
14 | 2194c2a12cc73 |
15 | dd52414acc38 |
hex | 6d4494d5ccb5 |
120141322243253 has 8 divisors (see below), whose sum is σ = 126618212625600. Its totient is φ = 113679798150528.
The previous prime is 120141322243223. The next prime is 120141322243277. The reversal of 120141322243253 is 352342223141021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120141322243253 - 210 = 120141322242229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120141322243223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3841556348 + ... + 3841587621.
It is an arithmetic number, because the mean of its divisors is an integer number (15827276578200).
Almost surely, 2120141322243253 is an apocalyptic number.
It is an amenable number.
120141322243253 is a deficient number, since it is larger than the sum of its proper divisors (6476890382347).
120141322243253 is an equidigital number, since it uses as much as digits as its factorization.
120141322243253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7683144811.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 120141322243253 its reverse (352342223141021), we get a palindrome (472483545384274).
The spelling of 120141322243253 in words is "one hundred twenty trillion, one hundred forty-one billion, three hundred twenty-two million, two hundred forty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •