Base | Representation |
---|---|
bin | 100001010101100000100000… |
… | …000100010101010100001111 |
3 | 201020010010011210120212121021 |
4 | 201111200200010111110033 |
5 | 123204104013123414210 |
6 | 1235453155312215011 |
7 | 42611323144405003 |
oct | 4125404004252417 |
9 | 636103153525537 |
10 | 146613541623055 |
11 | 427964aa048001 |
12 | 1453a82a53a467 |
13 | 63a67a0068cb0 |
14 | 282c1c19d8703 |
15 | 11e3b4c07ebda |
hex | 85582011550f |
146613541623055 has 16 divisors (see below), whose sum is σ = 189597225250944. Its totient is φ = 108195651440640.
The previous prime is 146613541622987. The next prime is 146613541623089. The reversal of 146613541623055 is 550326145316641.
It is not a de Polignac number, because 146613541623055 - 213 = 146613541614863 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146613541622993 and 146613541623011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 758340786 + ... + 758534095.
It is an arithmetic number, because the mean of its divisors is an integer number (11849826578184).
Almost surely, 2146613541623055 is an apocalyptic number.
146613541623055 is a deficient number, since it is larger than the sum of its proper divisors (42983683627889).
146613541623055 is a wasteful number, since it uses less digits than its factorization.
146613541623055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1516876386.
The product of its (nonzero) digits is 7776000, while the sum is 52.
Adding to 146613541623055 its reverse (550326145316641), we get a palindrome (696939686939696).
The spelling of 146613541623055 in words is "one hundred forty-six trillion, six hundred thirteen billion, five hundred forty-one million, six hundred twenty-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •