Base | Representation |
---|---|
bin | 1011001000010100… |
… | …00100010111111101 |
3 | 120102102122010101211 |
4 | 11210022010113331 |
5 | 44214141001003 |
6 | 2424532004421 |
7 | 301034311036 |
oct | 54412042775 |
9 | 16372563354 |
10 | 5975328253 |
11 | 2596a0a614 |
12 | 11a9160711 |
13 | 742c3b0bb |
14 | 409829a8d |
15 | 24e8b296d |
hex | 1642845fd |
5975328253 has 2 divisors, whose sum is σ = 5975328254. Its totient is φ = 5975328252.
The previous prime is 5975328251. The next prime is 5975328269. The reversal of 5975328253 is 3528235795.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3333676644 + 2641651609 = 57738^2 + 51397^2 .
It is a cyclic number.
It is not a de Polignac number, because 5975328253 - 21 = 5975328251 is a prime.
It is a super-2 number, since 2×59753282532 = 71409095462200064018, which contains 22 as substring.
Together with 5975328251, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5975328197 and 5975328206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5975328251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2987664126 + 2987664127.
It is an arithmetic number, because the mean of its divisors is an integer number (2987664127).
Almost surely, 25975328253 is an apocalyptic number.
It is an amenable number.
5975328253 is a deficient number, since it is larger than the sum of its proper divisors (1).
5975328253 is an equidigital number, since it uses as much as digits as its factorization.
5975328253 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2268000, while the sum is 49.
The square root of 5975328253 is about 77300.2474316868. The cubic root of 5975328253 is about 1814.6265301232.
The spelling of 5975328253 in words is "five billion, nine hundred seventy-five million, three hundred twenty-eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •