Base | Representation |
---|---|
bin | 100001000110000101110111… |
… | …000000011111111010100010 |
3 | 201002100211200111202200120220 |
4 | 201012011313000133322202 |
5 | 123034224341142013240 |
6 | 1233322352245543510 |
7 | 42441640234351005 |
oct | 4106056700377242 |
9 | 632324614680526 |
10 | 145554143313570 |
11 | 42418190348042 |
12 | 143a9450114b96 |
13 | 632a909bb1484 |
14 | 27d2c029a553c |
15 | 11c62e5d195d0 |
hex | 84617701fea2 |
145554143313570 has 32 divisors (see below), whose sum is σ = 369878764186368. Its totient is φ = 36531235968768.
The previous prime is 145554143313539. The next prime is 145554143313583. The reversal of 145554143313570 is 75313341455541.
It is a super-4 number, since 4×1455541433135704 (a number of 58 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 142700139994 + ... + 142700141013.
It is an arithmetic number, because the mean of its divisors is an integer number (11558711380824).
Almost surely, 2145554143313570 is an apocalyptic number.
145554143313570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145554143313570 is an abundant number, since it is smaller than the sum of its proper divisors (224324620872798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145554143313570 is a wasteful number, since it uses less digits than its factorization.
145554143313570 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285400281034.
The product of its (nonzero) digits is 7560000, while the sum is 51.
The spelling of 145554143313570 in words is "one hundred forty-five trillion, five hundred fifty-four billion, one hundred forty-three million, three hundred thirteen thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •