Base | Representation |
---|---|
bin | 100000111110111010010000… |
… | …111010010001100110101001 |
3 | 201000121122220120112210010121 |
4 | 200332322100322101212221 |
5 | 123003133211100310130 |
6 | 1232303540134043241 |
7 | 42361200205052320 |
oct | 4076722072214651 |
9 | 630548816483117 |
10 | 145060656650665 |
11 | 42247973a57168 |
12 | 143298884a9521 |
13 | 62c32132a4022 |
14 | 27b6d8a8190b7 |
15 | 11b8561e1dd7a |
hex | 83ee90e919a9 |
145060656650665 has 8 divisors (see below), whose sum is σ = 198940329120960. Its totient is φ = 99470164560432.
The previous prime is 145060656650653. The next prime is 145060656650731. The reversal of 145060656650665 is 566056656060541.
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 145060656650665 - 227 = 145060522432937 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2072295094975 + ... + 2072295095044.
It is an arithmetic number, because the mean of its divisors is an integer number (24867541140120).
Almost surely, 2145060656650665 is an apocalyptic number.
It is an amenable number.
145060656650665 is a deficient number, since it is larger than the sum of its proper divisors (53879672470295).
145060656650665 is an equidigital number, since it uses as much as digits as its factorization.
145060656650665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4144590190031.
The product of its (nonzero) digits is 116640000, while the sum is 61.
The spelling of 145060656650665 in words is "one hundred forty-five trillion, sixty billion, six hundred fifty-six million, six hundred fifty thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •