Base | Representation |
---|---|
bin | 100001010101111011001110… |
… | …110000100001011111110001 |
3 | 201020012212020222212121122000 |
4 | 201111323032300201133301 |
5 | 123210041303003343031 |
6 | 1235514303250204213 |
7 | 42613360315601301 |
oct | 4125731660413761 |
9 | 636185228777560 |
10 | 146642242246641 |
11 | 427a769787a329 |
12 | 145442ba283669 |
13 | 63a93c5183bbb |
14 | 282d745645601 |
15 | 11e477ba8d3e6 |
hex | 855ecec217f1 |
146642242246641 has 16 divisors (see below), whose sum is σ = 217436513310720. Its totient is φ = 97676558672400.
The previous prime is 146642242246609. The next prime is 146642242246697.
146642242246641 is a `hidden beast` number, since 1 + 4 + 66 + 42 + 2 + 42 + 2 + 466 + 41 = 666.
146642242246641 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 146642242246641 - 25 = 146642242246609 is a prime.
It is a super-2 number, since 2×1466422422466412 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (146642242246541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2359306090 + ... + 2359368243.
It is an arithmetic number, because the mean of its divisors is an integer number (13589782081920).
Almost surely, 2146642242246641 is an apocalyptic number.
It is an amenable number.
146642242246641 is a deficient number, since it is larger than the sum of its proper divisors (70794271064079).
146642242246641 is a wasteful number, since it uses less digits than its factorization.
146642242246641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4718675493 (or 4718675487 counting only the distinct ones).
The product of its digits is 21233664, while the sum is 54.
The spelling of 146642242246641 in words is "one hundred forty-six trillion, six hundred forty-two billion, two hundred forty-two million, two hundred forty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •