Base | Representation |
---|---|
bin | 100000111110001100101000… |
… | …001000100011100010110100 |
3 | 201000102222102111200122011212 |
4 | 200332030220020203202310 |
5 | 123001332331430134403 |
6 | 1232225233444220552 |
7 | 42354513654460022 |
oct | 4076145010434264 |
9 | 630388374618155 |
10 | 145011654146228 |
11 | 42229108357311 |
12 | 1432029169a758 |
13 | 62bb7040a557c |
14 | 27b485c783712 |
15 | 11b7144e134d8 |
hex | 83e3282238b4 |
145011654146228 has 12 divisors (see below), whose sum is σ = 260629054073892. Its totient is φ = 70546210125120.
The previous prime is 145011654146221. The next prime is 145011654146237. The reversal of 145011654146228 is 822641456110541.
It can be written as a sum of positive squares in 2 ways, for example, as 95487528019984 + 49524126126244 = 9771772^2 + 7037338^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145011654146221) 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 3 ways as a sum of consecutive naturals, for example, 489904236833 + ... + 489904237128.
It is an arithmetic number, because the mean of its divisors is an integer number (21719087839491).
Almost surely, 2145011654146228 is an apocalyptic number.
It is an amenable number.
145011654146228 is a deficient number, since it is larger than the sum of its proper divisors (115617399927664).
145011654146228 is a wasteful number, since it uses less digits than its factorization.
145011654146228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 979808474002 (or 979808474000 counting only the distinct ones).
The product of its (nonzero) digits is 1843200, while the sum is 50.
The spelling of 145011654146228 in words is "one hundred forty-five trillion, eleven billion, six hundred fifty-four million, one hundred forty-six thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •