Base | Representation |
---|---|
bin | 111100110110111… |
… | …001101100011101 |
3 | 2122011020110001201 |
4 | 330312321230131 |
5 | 4042340300203 |
6 | 245152035501 |
7 | 34205366266 |
oct | 7466715435 |
9 | 2564213051 |
10 | 1021025053 |
11 | 484384264 |
12 | 245b32b91 |
13 | 1336bc049 |
14 | 9986196d |
15 | 5e985e1d |
hex | 3cdb9b1d |
1021025053 has 2 divisors, whose sum is σ = 1021025054. Its totient is φ = 1021025052.
The previous prime is 1021025029. The next prime is 1021025099. The reversal of 1021025053 is 3505201201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 666569124 + 354455929 = 25818^2 + 18827^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021025053 - 29 = 1021024541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1021025053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021025023) 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, 510512526 + 510512527.
It is an arithmetic number, because the mean of its divisors is an integer number (510512527).
Almost surely, 21021025053 is an apocalyptic number.
It is an amenable number.
1021025053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021025053 is an equidigital number, since it uses as much as digits as its factorization.
1021025053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 1021025053 is about 31953.4826427418. The cubic root of 1021025053 is about 1006.9597998118.
Adding to 1021025053 its reverse (3505201201), we get a palindrome (4526226254).
The spelling of 1021025053 in words is "one billion, twenty-one million, twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •