Base | Representation |
---|---|
bin | 1001101000100101011… |
… | …1001011011101100100 |
3 | 120211012220111102101101 |
4 | 2122021113023131210 |
5 | 10202432401441400 |
6 | 204011420405444 |
7 | 14646400640263 |
oct | 2321127133544 |
9 | 524186442341 |
10 | 165513312100 |
11 | 64214a4a144 |
12 | 280b20a6884 |
13 | 127b9561886 |
14 | 8021c345da |
15 | 448a9db56a |
hex | 26895cb764 |
165513312100 has 36 divisors (see below), whose sum is σ = 370749826048. Its totient is φ = 64069668000.
The previous prime is 165513312073. The next prime is 165513312101. The reversal of 165513312100 is 1213315561.
165513312100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (165513312101) 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 11 ways as a sum of consecutive naturals, for example, 26692596 + ... + 26698795.
Almost surely, 2165513312100 is an apocalyptic number.
165513312100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
165513312100 is an abundant number, since it is smaller than the sum of its proper divisors (205236513948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
165513312100 is a wasteful number, since it uses less digits than its factorization.
165513312100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53391436 (or 53391429 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 28.
Adding to 165513312100 its reverse (1213315561), we get a palindrome (166726627661).
The spelling of 165513312100 in words is "one hundred sixty-five billion, five hundred thirteen million, three hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •