Base | Representation |
---|---|
bin | 11011010100010101100001… |
… | …111110111101011001001001 |
3 | 120202101201122011220111202120 |
4 | 123110111201332331121021 |
5 | 111221422434100042403 |
6 | 1103305424225121453 |
7 | 34210113153346626 |
oct | 3324254176753111 |
9 | 522351564814676 |
10 | 120144764065353 |
11 | 35311121169145 |
12 | 11584a3a489289 |
13 | 52067aacc0c41 |
14 | 21950752a534d |
15 | dd5393726e53 |
hex | 6d4561fbd649 |
120144764065353 has 16 divisors (see below), whose sum is σ = 161363777877120. Its totient is φ = 79511140446336.
The previous prime is 120144764065343. The next prime is 120144764065363. The reversal of 120144764065353 is 353560467441021.
It is an interprime number because it is at equal distance from previous prime (120144764065343) and next prime (120144764065363).
It is not a de Polignac number, because 120144764065353 - 222 = 120144759871049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120144764065296 and 120144764065305.
It is not an unprimeable number, because it can be changed into a prime (120144764065343) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45980103 + ... + 48522771.
It is an arithmetic number, because the mean of its divisors is an integer number (10085236117320).
Almost surely, 2120144764065353 is an apocalyptic number.
It is an amenable number.
120144764065353 is a deficient number, since it is larger than the sum of its proper divisors (41219013811767).
120144764065353 is a wasteful number, since it uses less digits than its factorization.
120144764065353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2657776.
The product of its (nonzero) digits is 7257600, while the sum is 51.
The spelling of 120144764065353 in words is "one hundred twenty trillion, one hundred forty-four billion, seven hundred sixty-four million, sixty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •