Base | Representation |
---|---|
bin | 100001010101010101001010… |
… | …000110111101110111100111 |
3 | 201020001221201222120200200110 |
4 | 201111111022012331313213 |
5 | 123203404042141222011 |
6 | 1235443422545544103 |
7 | 42610412262651111 |
oct | 4125251206756747 |
9 | 636057658520613 |
10 | 146601362054631 |
11 | 42791319a98a80 |
12 | 145383ab645033 |
13 | 63a55ab951b83 |
14 | 282b7881d63b1 |
15 | 11e3687b8dba6 |
hex | 85554a1bdde7 |
146601362054631 has 32 divisors (see below), whose sum is σ = 214525133157888. Its totient is φ = 88313197696640.
The previous prime is 146601362054593. The next prime is 146601362054657. The reversal of 146601362054631 is 136450263106641.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 146601362054631 - 211 = 146601362052583 is a prime.
It is a super-2 number, since 2×1466013620546312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146601362054131) 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, 120842341 + ... + 122049473.
It is an arithmetic number, because the mean of its divisors is an integer number (6703910411184).
Almost surely, 2146601362054631 is an apocalyptic number.
146601362054631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
146601362054631 is a deficient number, since it is larger than the sum of its proper divisors (67923771103257).
146601362054631 is a wasteful number, since it uses less digits than its factorization.
146601362054631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1229351.
The product of its (nonzero) digits is 1866240, while the sum is 48.
The spelling of 146601362054631 in words is "one hundred forty-six trillion, six hundred one billion, three hundred sixty-two million, fifty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •