Base | Representation |
---|---|
bin | 1000101101001111111… |
… | …1110101111010110101 |
3 | 112022002212201122122221 |
4 | 2023103333311322311 |
5 | 4422322404212230 |
6 | 152415122522341 |
7 | 13543604522200 |
oct | 2132377657265 |
9 | 468085648587 |
10 | 149585616565 |
11 | 584911a9800 |
12 | 24ba7b063b1 |
13 | 1114b773068 |
14 | 7350724937 |
15 | 3d5752927a |
hex | 22d3ff5eb5 |
149585616565 has 36 divisors (see below), whose sum is σ = 229517716428. Its totient is φ = 93248158080.
The previous prime is 149585616563. The next prime is 149585616617. The reversal of 149585616565 is 565616585941.
It can be written as a sum of positive squares in 2 ways, for example, as 57826301841 + 91759314724 = 240471^2 + 302918^2 .
It is not a de Polignac number, because 149585616565 - 21 = 149585616563 is a prime.
It is a Smith number, since the sum of its digits (61) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149585616563) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2493304 + ... + 2552593.
It is an arithmetic number, because the mean of its divisors is an integer number (6375492123).
Almost surely, 2149585616565 is an apocalyptic number.
It is an amenable number.
149585616565 is a deficient number, since it is larger than the sum of its proper divisors (79932099863).
149585616565 is a wasteful number, since it uses less digits than its factorization.
149585616565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5045938 (or 5045920 counting only the distinct ones).
The product of its digits is 38880000, while the sum is 61.
The spelling of 149585616565 in words is "one hundred forty-nine billion, five hundred eighty-five million, six hundred sixteen thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •