Base | Representation |
---|---|
bin | 100001000011010000101111… |
… | …111100011101100100000100 |
3 | 201001200020201212010002000010 |
4 | 201003100233330131210010 |
5 | 123023033104422412313 |
6 | 1233053151453350220 |
7 | 42421614213525444 |
oct | 4103205774354404 |
9 | 631606655102003 |
10 | 145359677544708 |
11 | 42352769500690 |
12 | 14377819a98370 |
13 | 63154882ccaa3 |
14 | 27c76358cc124 |
15 | 11c12136774c3 |
hex | 84342ff1d904 |
145359677544708 has 96 divisors (see below), whose sum is σ = 370754715082752. Its totient is φ = 43959378355200.
The previous prime is 145359677544703. The next prime is 145359677544787. The reversal of 145359677544708 is 807445776953541.
It is a super-2 number, since 2×1453596775447082 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 145359677544708.
It is not an unprimeable number, because it can be changed into a prime (145359677544703) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 165774885 + ... + 166649427.
It is an arithmetic number, because the mean of its divisors is an integer number (3862028282112).
Almost surely, 2145359677544708 is an apocalyptic number.
It is an amenable number.
145359677544708 is an abundant number, since it is smaller than the sum of its proper divisors (225395037538044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145359677544708 is a wasteful number, since it uses less digits than its factorization.
145359677544708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 877105 (or 877103 counting only the distinct ones).
The product of its (nonzero) digits is 3556224000, while the sum is 75.
The spelling of 145359677544708 in words is "one hundred forty-five trillion, three hundred fifty-nine billion, six hundred seventy-seven million, five hundred forty-four thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •