Base | Representation |
---|---|
bin | 100001000110110100110000… |
… | …100001111011000010000101 |
3 | 201002112122122222200211201111 |
4 | 201012310300201323002011 |
5 | 123041041004112004423 |
6 | 1233401441211125021 |
7 | 42445402154363260 |
oct | 4106646041730205 |
9 | 632478588624644 |
10 | 145604500500613 |
11 | 424375816a3aa0 |
12 | 143b7164743771 |
13 | 63325a395277b |
14 | 27d541c913cd7 |
15 | 11c7791c1760d |
hex | 846d3087b085 |
145604500500613 has 32 divisors (see below), whose sum is σ = 182433667829760. Its totient is φ = 112895797896000.
The previous prime is 145604500500601. The next prime is 145604500500617. The reversal of 145604500500613 is 316005005406541.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-145604500500613 is a prime.
It is a super-2 number, since 2×1456045005006132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145604500500617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20693983 + ... + 26822563.
It is an arithmetic number, because the mean of its divisors is an integer number (5701052119680).
Almost surely, 2145604500500613 is an apocalyptic number.
It is an amenable number.
145604500500613 is a deficient number, since it is larger than the sum of its proper divisors (36829167329147).
145604500500613 is a wasteful number, since it uses less digits than its factorization.
145604500500613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6130129.
The product of its (nonzero) digits is 216000, while the sum is 40.
The spelling of 145604500500613 in words is "one hundred forty-five trillion, six hundred four billion, five hundred million, five hundred thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •