Base | Representation |
---|---|
bin | 100001010011010111011010… |
… | …011000101011110000000001 |
3 | 201012121001020022122211011201 |
4 | 201103113122120223300001 |
5 | 123144201032434232031 |
6 | 1235301413121141201 |
7 | 42564562351404130 |
oct | 4123273230536001 |
9 | 635531208584151 |
10 | 146466343664641 |
11 | 4273a0336a1200 |
12 | 145161aa18a801 |
13 | 6395942180110 |
14 | 282501a43d917 |
15 | 11dedd448ed61 |
hex | 8535da62bc01 |
146466343664641 has 48 divisors (see below), whose sum is σ = 198400258248192. Its totient is φ = 105214123175040.
The previous prime is 146466343664629. The next prime is 146466343664677.
146466343664641 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 146466343664641 - 211 = 146466343662593 is a prime.
It is not an unprimeable number, because it can be changed into a prime (146466343664611) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 92521 + ... + 17115526.
It is an arithmetic number, because the mean of its divisors is an integer number (4133338713504).
Almost surely, 2146466343664641 is an apocalyptic number.
146466343664641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
146466343664641 is a deficient number, since it is larger than the sum of its proper divisors (51933914583551).
146466343664641 is a wasteful number, since it uses less digits than its factorization.
146466343664641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17208862 (or 17208851 counting only the distinct ones).
The product of its digits is 429981696, while the sum is 64.
The spelling of 146466343664641 in words is "one hundred forty-six trillion, four hundred sixty-six billion, three hundred forty-three million, six hundred sixty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •