Base | Representation |
---|---|
bin | 100001001101001100110010… |
… | …101111100101110011100101 |
3 | 201011002112112120220222222201 |
4 | 201031030302233211303211 |
5 | 123120230243310133214 |
6 | 1234335015544454501 |
7 | 42522142242300220 |
oct | 4115146257456345 |
9 | 634075476828881 |
10 | 146042624302309 |
11 | 42596369105919 |
12 | 1446805747a431 |
13 | 63649b6724447 |
14 | 280c7020145b7 |
15 | 11d3d8553c274 |
hex | 84d332be5ce5 |
146042624302309 has 8 divisors (see below), whose sum is σ = 166905932652288. Its totient is φ = 125179335029040.
The previous prime is 146042624302307. The next prime is 146042624302433. The reversal of 146042624302309 is 903203426240641.
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 146042624302309 - 21 = 146042624302307 is a prime.
It is a super-2 number, since 2×1460426243023092 (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 (146042624302301) 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, 20711259 + ... + 26852215.
It is an arithmetic number, because the mean of its divisors is an integer number (20863241581536).
Almost surely, 2146042624302309 is an apocalyptic number.
It is an amenable number.
146042624302309 is a deficient number, since it is larger than the sum of its proper divisors (20863308349979).
146042624302309 is an equidigital number, since it uses as much as digits as its factorization.
146042624302309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9538355.
The product of its (nonzero) digits is 1492992, while the sum is 46.
The spelling of 146042624302309 in words is "one hundred forty-six trillion, forty-two billion, six hundred twenty-four million, three hundred two thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •