Base | Representation |
---|---|
bin | 100001001110101101100100… |
… | …111000001001011000001001 |
3 | 201011110110202222100011120101 |
4 | 201032231210320021120021 |
5 | 123123431110410333230 |
6 | 1234454443513525401 |
7 | 42532511421364402 |
oct | 4116554470113011 |
9 | 634413688304511 |
10 | 146146544621065 |
11 | 4262644645147a |
12 | 1448421a113861 |
13 | 63717384a7311 |
14 | 281375d9a69a9 |
15 | 11d6918a0caca |
hex | 84eb64e09609 |
146146544621065 has 8 divisors (see below), whose sum is σ = 185692080224520. Its totient is φ = 110039751244032.
The previous prime is 146146544621017. The next prime is 146146544621081. The reversal of 146146544621065 is 560126445641641.
It can be written as a sum of positive squares in 4 ways, for example, as 7463583585936 + 138682961035129 = 2731956^2 + 11776373^2 .
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 146146544621065 - 29 = 146146544620553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146146544620997 and 146146544621015.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 859685556510 + ... + 859685556679.
It is an arithmetic number, because the mean of its divisors is an integer number (23211510028065).
Almost surely, 2146146544621065 is an apocalyptic number.
It is an amenable number.
146146544621065 is a deficient number, since it is larger than the sum of its proper divisors (39545535603455).
146146544621065 is a wasteful number, since it uses less digits than its factorization.
146146544621065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1719371113211.
The product of its (nonzero) digits is 16588800, while the sum is 55.
The spelling of 146146544621065 in words is "one hundred forty-six trillion, one hundred forty-six billion, five hundred forty-four million, six hundred twenty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •