Base | Representation |
---|---|
bin | 100001001001000110000110… |
… | …111001110000010011011011 |
3 | 201010002120111122000011021221 |
4 | 201021012012321300103123 |
5 | 123101120121003130410 |
6 | 1234001251500112511 |
7 | 42462565523625352 |
oct | 4111060671602333 |
9 | 633076448004257 |
10 | 145760568411355 |
11 | 42497789997307 |
12 | 1442145b535737 |
13 | 6344216387551 |
14 | 27dcbc6110999 |
15 | 11cb8783964da |
hex | 849186e704db |
145760568411355 has 8 divisors (see below), whose sum is σ = 182517581315232. Its totient is φ = 111538521914688.
The previous prime is 145760568411331. The next prime is 145760568411371. The reversal of 145760568411355 is 553114865067541.
It is a happy number.
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 145760568411355 - 211 = 145760568409307 is a prime.
It is a super-2 number, since 2×1457605684113552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145760568411293 and 145760568411302.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 633741601674 + ... + 633741601903.
It is an arithmetic number, because the mean of its divisors is an integer number (22814697664404).
Almost surely, 2145760568411355 is an apocalyptic number.
145760568411355 is a deficient number, since it is larger than the sum of its proper divisors (36757012903877).
145760568411355 is a wasteful number, since it uses less digits than its factorization.
145760568411355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1267483203605.
The product of its (nonzero) digits is 60480000, while the sum is 61.
The spelling of 145760568411355 in words is "one hundred forty-five trillion, seven hundred sixty billion, five hundred sixty-eight million, four hundred eleven thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •