Base | Representation |
---|---|
bin | 1000011101011001111… |
… | …1101100100101010000 |
3 | 111220010110211200201120 |
4 | 2013112133230211100 |
5 | 4340120113212224 |
6 | 150433113002240 |
7 | 13333322220105 |
oct | 2072637544520 |
9 | 456113750646 |
10 | 145332554064 |
11 | 566a948aa15 |
12 | 241bb6b3380 |
13 | 109215a9029 |
14 | 7069938aac |
15 | 3ba8e67779 |
hex | 21d67ec950 |
145332554064 has 20 divisors (see below), whose sum is σ = 375442431456. Its totient is φ = 48444184672.
The previous prime is 145332554063. The next prime is 145332554071. The reversal of 145332554064 is 460455233541.
145332554064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1453325540642 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145332554063) 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, 1513880724 + ... + 1513880819.
Almost surely, 2145332554064 is an apocalyptic number.
It is an amenable number.
145332554064 is an abundant number, since it is smaller than the sum of its proper divisors (230109877392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145332554064 is a wasteful number, since it uses less digits than its factorization.
145332554064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3027761554 (or 3027761548 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 42.
The spelling of 145332554064 in words is "one hundred forty-five billion, three hundred thirty-two million, five hundred fifty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •