Base | Representation |
---|---|
bin | 101111010000101… |
… | …0111001101110100 |
3 | 11002111222012022222 |
4 | 1132201113031310 |
5 | 11221431213043 |
6 | 421205141512 |
7 | 54204053465 |
oct | 13641271564 |
9 | 4074865288 |
10 | 1585804148 |
11 | 744166145 |
12 | 3830ba898 |
13 | 1c3705466 |
14 | 11087ad6c |
15 | 94347d68 |
hex | 5e857374 |
1585804148 has 6 divisors (see below), whose sum is σ = 2775157266. Its totient is φ = 792902072.
The previous prime is 1585804147. The next prime is 1585804153. The reversal of 1585804148 is 8414085851.
It can be written as a sum of positive squares in only one way, i.e., 921608164 + 664195984 = 30358^2 + 25772^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1585804099 and 1585804108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1585804141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 198225515 + ... + 198225522.
It is an arithmetic number, because the mean of its divisors is an integer number (462526211).
Almost surely, 21585804148 is an apocalyptic number.
It is an amenable number.
1585804148 is a deficient number, since it is larger than the sum of its proper divisors (1189353118).
1585804148 is a wasteful number, since it uses less digits than its factorization.
1585804148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396451041 (or 396451039 counting only the distinct ones).
The product of its (nonzero) digits is 204800, while the sum is 44.
The square root of 1585804148 is about 39822.1564961015. The cubic root of 1585804148 is about 1166.1377375248.
Adding to 1585804148 its reverse (8414085851), we get a palindrome (9999889999).
The spelling of 1585804148 in words is "one billion, five hundred eighty-five million, eight hundred four thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •