Base | Representation |
---|---|
bin | 10110111110101… |
… | …001010111101101 |
3 | 222212102111120111 |
4 | 112332221113231 |
5 | 1242143134013 |
6 | 102131020021 |
7 | 12360606214 |
oct | 2676512755 |
9 | 885374514 |
10 | 385521133 |
11 | 188686808 |
12 | a913a611 |
13 | 61b4221a |
14 | 392b607b |
15 | 23ca373d |
hex | 16fa95ed |
385521133 has 2 divisors, whose sum is σ = 385521134. Its totient is φ = 385521132.
The previous prime is 385521091. The next prime is 385521179. The reversal of 385521133 is 331125583.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 278956804 + 106564329 = 16702^2 + 10323^2 .
It is an emirp because it is prime and its reverse (331125583) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-385521133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 385521095 and 385521104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (385521233) 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 as a sum of consecutive naturals, namely, 192760566 + 192760567.
It is an arithmetic number, because the mean of its divisors is an integer number (192760567).
Almost surely, 2385521133 is an apocalyptic number.
It is an amenable number.
385521133 is a deficient number, since it is larger than the sum of its proper divisors (1).
385521133 is an equidigital number, since it uses as much as digits as its factorization.
385521133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 31.
The square root of 385521133 is about 19634.6920780541. The cubic root of 385521133 is about 727.8067233615.
The spelling of 385521133 in words is "three hundred eighty-five million, five hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •