Base | Representation |
---|---|
bin | 1000011100001101011… |
… | …0111111110100100000 |
3 | 111212022002201210012201 |
4 | 2013003112333310200 |
5 | 4333440421201324 |
6 | 150341203502544 |
7 | 13322343316216 |
oct | 2070326776440 |
9 | 455262653181 |
10 | 145011506464 |
11 | 56554240120 |
12 | 24130087a54 |
13 | 1089cc1c036 |
14 | 7039046cb6 |
15 | 3b8ab9c444 |
hex | 21c35bfd20 |
145011506464 has 96 divisors (see below), whose sum is σ = 317586552192. Its totient is φ = 64624896000.
The previous prime is 145011506459. The next prime is 145011506483. The reversal of 145011506464 is 464605110541.
145011506464 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 4507524 + ... + 4539580.
It is an arithmetic number, because the mean of its divisors is an integer number (3308193252).
Almost surely, 2145011506464 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145011506464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158793276096).
145011506464 is an abundant number, since it is smaller than the sum of its proper divisors (172575045728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145011506464 is a wasteful number, since it uses less digits than its factorization.
145011506464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32330 (or 32322 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 37.
The spelling of 145011506464 in words is "one hundred forty-five billion, eleven million, five hundred six thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •