Base | Representation |
---|---|
bin | 1000011110100010011… |
… | …0011110010000011010 |
3 | 111220220122102121122020 |
4 | 2013220212132100122 |
5 | 4341230344222112 |
6 | 150523203435310 |
7 | 13344001203645 |
oct | 2075046362032 |
9 | 456818377566 |
10 | 145636320282 |
11 | 568449a6a82 |
12 | 24285385b36 |
13 | 1096c4c515b |
14 | 709800ca5c |
15 | 3bc596c48c |
hex | 21e899e41a |
145636320282 has 8 divisors (see below), whose sum is σ = 291272640576. Its totient is φ = 48545440092.
The previous prime is 145636320259. The next prime is 145636320283. The reversal of 145636320282 is 282023636541.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
145636320282 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (145636320283) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 12136360018 + ... + 12136360029.
It is an arithmetic number, because the mean of its divisors is an integer number (36409080072).
Almost surely, 2145636320282 is an apocalyptic number.
145636320282 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145636320282 is a wasteful number, since it uses less digits than its factorization.
145636320282 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24272720052.
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 145636320282 in words is "one hundred forty-five billion, six hundred thirty-six million, three hundred twenty thousand, two hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •