Base | Representation |
---|---|
bin | 1000011110011010101… |
… | …1010100101000011011 |
3 | 111220211101200110111120 |
4 | 2013212223110220123 |
5 | 4341144113142042 |
6 | 150520051500323 |
7 | 13343126616012 |
oct | 2074653245033 |
9 | 456741613446 |
10 | 145604037147 |
11 | 568287571a8 |
12 | 242765b76a3 |
13 | 10965900bca |
14 | 7093a07a79 |
15 | 3bc2be1dec |
hex | 21e6ad4a1b |
145604037147 has 8 divisors (see below), whose sum is σ = 195441661200. Its totient is φ = 96417885600.
The previous prime is 145604037133. The next prime is 145604037149. The reversal of 145604037147 is 741730406541.
145604037147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145604037147 - 212 = 145604033051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145604037099 and 145604037108.
It is not an unprimeable number, because it can be changed into a prime (145604037149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 162867604 + ... + 162868497.
It is an arithmetic number, because the mean of its divisors is an integer number (24430207650).
Almost surely, 2145604037147 is an apocalyptic number.
145604037147 is a deficient number, since it is larger than the sum of its proper divisors (49837624053).
145604037147 is a wasteful number, since it uses less digits than its factorization.
145604037147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325736253.
The product of its (nonzero) digits is 282240, while the sum is 42.
The spelling of 145604037147 in words is "one hundred forty-five billion, six hundred four million, thirty-seven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •