Base | Representation |
---|---|
bin | 100001000110001011010110… |
… | …100000111110110101101100 |
3 | 201002101101220111121111011102 |
4 | 201012023112200332311230 |
5 | 123034323430400203120 |
6 | 1233325205353542232 |
7 | 42442236333624134 |
oct | 4106132640766554 |
9 | 632341814544142 |
10 | 145560040631660 |
11 | 4241a737215446 |
12 | 143aa617114978 |
13 | 632b339907ac5 |
14 | 27d3201cc5ac4 |
15 | 11c653d91cd75 |
hex | 8462d683ed6c |
145560040631660 has 48 divisors (see below), whose sum is σ = 310860501628320. Its totient is φ = 57236530391040.
The previous prime is 145560040631639. The next prime is 145560040631669. The reversal of 145560040631660 is 66136040065541.
It is not an unprimeable number, because it can be changed into a prime (145560040631669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 113184572 + ... + 114463388.
It is an arithmetic number, because the mean of its divisors is an integer number (6476260450590).
Almost surely, 2145560040631660 is an apocalyptic number.
145560040631660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145560040631660 is an abundant number, since it is smaller than the sum of its proper divisors (165300460996660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145560040631660 is a wasteful number, since it uses less digits than its factorization.
145560040631660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1375346 (or 1375344 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 145560040631660 in words is "one hundred forty-five trillion, five hundred sixty billion, forty million, six hundred thirty-one thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •