Base | Representation |
---|---|
bin | 1000011100011001110… |
… | …0010110101110010101 |
3 | 111212102201002020220120 |
4 | 2013012130112232111 |
5 | 4334042142231040 |
6 | 150350252422153 |
7 | 13323542134446 |
oct | 2070634265625 |
9 | 455381066816 |
10 | 145063242645 |
11 | 565804672a2 |
12 | 24145477959 |
13 | 108aa864769 |
14 | 7041c732cd |
15 | 3b904bb7d0 |
hex | 21c6716b95 |
145063242645 has 16 divisors (see below), whose sum is σ = 235906127232. Its totient is φ = 76098749760.
The previous prime is 145063242631. The next prime is 145063242703. The reversal of 145063242645 is 546242360541.
It is a happy number.
145063242645 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 145063242645 - 210 = 145063241621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145063242597 and 145063242606.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 79268617 + ... + 79270446.
It is an arithmetic number, because the mean of its divisors is an integer number (14744132952).
Almost surely, 2145063242645 is an apocalyptic number.
145063242645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
145063242645 is a deficient number, since it is larger than the sum of its proper divisors (90842884587).
145063242645 is a wasteful number, since it uses less digits than its factorization.
145063242645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158539132.
The product of its (nonzero) digits is 691200, while the sum is 42.
The spelling of 145063242645 in words is "one hundred forty-five billion, sixty-three million, two hundred forty-two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •