Base | Representation |
---|---|
bin | 11111101100100… |
… | …000100011111001 |
3 | 1101001121021111201 |
4 | 133230200203321 |
5 | 2042112331101 |
6 | 124433254201 |
7 | 16114616533 |
oct | 3754404371 |
9 | 1331537451 |
10 | 531761401 |
11 | 253190236 |
12 | 12a104361 |
13 | 86225a22 |
14 | 508a2853 |
15 | 31a3de01 |
hex | 1fb208f9 |
531761401 has 4 divisors (see below), whose sum is σ = 531919732. Its totient is φ = 531603072.
The previous prime is 531761393. The next prime is 531761441. The reversal of 531761401 is 104167135.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 104167135 = 5 ⋅20833427.
It can be written as a sum of positive squares in 2 ways, for example, as 127148176 + 404613225 = 11276^2 + 20115^2 .
It is a cyclic number.
It is not a de Polignac number, because 531761401 - 23 = 531761393 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 531761401.
It is not an unprimeable number, because it can be changed into a prime (531761441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74016 + ... + 80881.
It is an arithmetic number, because the mean of its divisors is an integer number (132979933).
Almost surely, 2531761401 is an apocalyptic number.
It is an amenable number.
531761401 is a deficient number, since it is larger than the sum of its proper divisors (158331).
531761401 is a wasteful number, since it uses less digits than its factorization.
531761401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158330.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 531761401 is about 23059.9523199854. The cubic root of 531761401 is about 810.1627478700.
The spelling of 531761401 in words is "five hundred thirty-one million, seven hundred sixty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •