Base | Representation |
---|---|
bin | 100011001101001… |
… | …111010010011101 |
3 | 1112011110022002202 |
4 | 203031033102131 |
5 | 2202203014203 |
6 | 134340101245 |
7 | 20431431605 |
oct | 4315172235 |
9 | 1464408082 |
10 | 590673053 |
11 | 283468453 |
12 | 145994825 |
13 | 954b14a9 |
14 | 58639c05 |
15 | 36cc9388 |
hex | 2334f49d |
590673053 has 4 divisors (see below), whose sum is σ = 592037628. Its totient is φ = 589308480.
The previous prime is 590673037. The next prime is 590673059. The reversal of 590673053 is 350376095.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 350376095 = 5 ⋅70075219.
It can be written as a sum of positive squares in 2 ways, for example, as 61811044 + 528862009 = 7862^2 + 22997^2 .
It is a cyclic number.
It is not a de Polignac number, because 590673053 - 24 = 590673037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 590672998 and 590673016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (590673059) 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, 681638 + ... + 682503.
It is an arithmetic number, because the mean of its divisors is an integer number (148009407).
Almost surely, 2590673053 is an apocalyptic number.
It is an amenable number.
590673053 is a deficient number, since it is larger than the sum of its proper divisors (1364575).
590673053 is a wasteful number, since it uses less digits than its factorization.
590673053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1364574.
The product of its (nonzero) digits is 85050, while the sum is 38.
The square root of 590673053 is about 24303.7662307717. The cubic root of 590673053 is about 839.0394599587.
The spelling of 590673053 in words is "five hundred ninety million, six hundred seventy-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •