Base | Representation |
---|---|
bin | 11111111011000… |
… | …101000101110001 |
3 | 1101022210100001212 |
4 | 133323011011301 |
5 | 2044102043131 |
6 | 125051205505 |
7 | 16162235522 |
oct | 3773050561 |
9 | 1338710055 |
10 | 535581041 |
11 | 255359a66 |
12 | 12b446895 |
13 | 86c62478 |
14 | 511b8849 |
15 | 32045a2b |
hex | 1fec5171 |
535581041 has 4 divisors (see below), whose sum is σ = 536743284. Its totient is φ = 534418800.
The previous prime is 535580977. The next prime is 535581043. The reversal of 535581041 is 140185535.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 345030625 + 190550416 = 18575^2 + 13804^2 .
It is a cyclic number.
It is not a de Polignac number, because 535581041 - 26 = 535580977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 535580989 and 535581007.
It is not an unprimeable number, because it can be changed into a prime (535581043) 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 in 3 ways as a sum of consecutive naturals, for example, 580430 + ... + 581351.
It is an arithmetic number, because the mean of its divisors is an integer number (134185821).
Almost surely, 2535581041 is an apocalyptic number.
It is an amenable number.
535581041 is a deficient number, since it is larger than the sum of its proper divisors (1162243).
535581041 is a wasteful number, since it uses less digits than its factorization.
535581041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1162242.
The product of its (nonzero) digits is 12000, while the sum is 32.
The square root of 535581041 is about 23142.6239005001. The cubic root of 535581041 is about 812.0979203783.
The spelling of 535581041 in words is "five hundred thirty-five million, five hundred eighty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •