Base | Representation |
---|---|
bin | 100001001100111011000111… |
… | …110111010101100100001101 |
3 | 201011000201120022212200222102 |
4 | 201030323013313111210031 |
5 | 123114422414213123040 |
6 | 1234322201143324445 |
7 | 42520601130404405 |
oct | 4114730767254415 |
9 | 634021508780872 |
10 | 146023651301645 |
11 | 42589312370687 |
12 | 14464441450725 |
13 | 6362c81a4ac30 |
14 | 280b8222a7805 |
15 | 11d3624a37515 |
hex | 84cec7dd590d |
146023651301645 has 16 divisors (see below), whose sum is σ = 188718669269760. Its totient is φ = 107826460801344.
The previous prime is 146023651301641. The next prime is 146023651301681. The reversal of 146023651301645 is 546103156320641.
It is a cyclic number.
It is not a de Polignac number, because 146023651301645 - 22 = 146023651301641 is a prime.
It is a super-3 number, since 3×1460236513016453 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 146023651301645.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146023651301641) 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, 65450579 + ... + 67644848.
It is an arithmetic number, because the mean of its divisors is an integer number (11794916829360).
Almost surely, 2146023651301645 is an apocalyptic number.
It is an amenable number.
146023651301645 is a deficient number, since it is larger than the sum of its proper divisors (42695017968115).
146023651301645 is a wasteful number, since it uses less digits than its factorization.
146023651301645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133112324.
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 146023651301645 in words is "one hundred forty-six trillion, twenty-three billion, six hundred fifty-one million, three hundred one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •