Base | Representation |
---|---|
bin | 100001001101000111000111… |
… | …000110010010001001001101 |
3 | 201011001221210101220020011221 |
4 | 201031013013012102021031 |
5 | 123120130244434010321 |
6 | 1234332130324043341 |
7 | 42521535121100131 |
oct | 4115070706221115 |
9 | 634057711806157 |
10 | 146036523344461 |
11 | 425938182999a2 |
12 | 14466a34233551 |
13 | 636425376ac09 |
14 | 280c2c3a453c1 |
15 | 11d3b29b10e41 |
hex | 84d1c719224d |
146036523344461 has 8 divisors (see below), whose sum is σ = 146053034820000. Its totient is φ = 146020012385520.
The previous prime is 146036523344429. The next prime is 146036523344471. The reversal of 146036523344461 is 164443325630641.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146036523344461 - 25 = 146036523344429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146036523344399 and 146036523344408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146036523344471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 902108635 + ... + 902270503.
It is an arithmetic number, because the mean of its divisors is an integer number (18256629352500).
Almost surely, 2146036523344461 is an apocalyptic number.
It is an amenable number.
146036523344461 is a deficient number, since it is larger than the sum of its proper divisors (16511475539).
146036523344461 is a wasteful number, since it uses less digits than its factorization.
146036523344461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 258299.
The product of its (nonzero) digits is 14929920, while the sum is 52.
The spelling of 146036523344461 in words is "one hundred forty-six trillion, thirty-six billion, five hundred twenty-three million, three hundred forty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •