Base | Representation |
---|---|
bin | 100001000001000101111100… |
… | …001010011010101100111000 |
3 | 201001011000000122102001101001 |
4 | 201001011330022122230320 |
5 | 123013112333344303211 |
6 | 1232500502115134344 |
7 | 42405056561036614 |
oct | 4101057412325470 |
9 | 631130018361331 |
10 | 145210632416056 |
11 | 422a5535402509 |
12 | 14352962ba43b4 |
13 | 63043c481977c |
14 | 27c0336c9c344 |
15 | 11bc3dd812ac1 |
hex | 84117c29ab38 |
145210632416056 has 32 divisors (see below), whose sum is σ = 272469267655200. Its totient is φ = 72552164523520.
The previous prime is 145210632416051. The next prime is 145210632416141. The reversal of 145210632416056 is 650614236012541.
It is a super-2 number, since 2×1452106324160562 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145210632415997 and 145210632416015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145210632416051) 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, 360697005 + ... + 361099363.
It is an arithmetic number, because the mean of its divisors is an integer number (8514664614225).
Almost surely, 2145210632416056 is an apocalyptic number.
It is an amenable number.
145210632416056 is a deficient number, since it is larger than the sum of its proper divisors (127258635239144).
145210632416056 is a wasteful number, since it uses less digits than its factorization.
145210632416056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 435279 (or 435275 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 46.
Adding to 145210632416056 its reverse (650614236012541), we get a palindrome (795824868428597).
The spelling of 145210632416056 in words is "one hundred forty-five trillion, two hundred ten billion, six hundred thirty-two million, four hundred sixteen thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •