Base | Representation |
---|---|
bin | 1000011101100000101… |
… | …0100010111110110110 |
3 | 111220012102112202100011 |
4 | 2013120022202332312 |
5 | 4340144301023100 |
6 | 150435553210434 |
7 | 13334112260134 |
oct | 2073012427666 |
9 | 456172482304 |
10 | 145360564150 |
11 | 5671328134a |
12 | 24208b60a1a |
13 | 10927335349 |
14 | 706d54a754 |
15 | 3bab64bbba |
hex | 21d82a2fb6 |
145360564150 has 12 divisors (see below), whose sum is σ = 270370649412. Its totient is φ = 58144225640.
The previous prime is 145360564099. The next prime is 145360564169. The reversal of 145360564150 is 51465063541.
It is a happy number.
145360564150 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-3 number, since 3×1453605641503 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 5 ways as a sum of consecutive naturals, for example, 1453605592 + ... + 1453605691.
It is an arithmetic number, because the mean of its divisors is an integer number (22530887451).
Almost surely, 2145360564150 is an apocalyptic number.
145360564150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145360564150 is a deficient number, since it is larger than the sum of its proper divisors (125010085262).
145360564150 is a wasteful number, since it uses less digits than its factorization.
145360564150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2907211295 (or 2907211290 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 40.
The spelling of 145360564150 in words is "one hundred forty-five billion, three hundred sixty million, five hundred sixty-four thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •