Base | Representation |
---|---|
bin | 10100000001101111… |
… | …01101100001011101 |
3 | 1000202022211100020001 |
4 | 22000313231201131 |
5 | 134010004210441 |
6 | 4534525054301 |
7 | 530305453504 |
oct | 120067554135 |
9 | 30668740201 |
10 | 10752022621 |
11 | 461826680a |
12 | 21009b7391 |
13 | 1024742782 |
14 | 73dd9d83b |
15 | 42de09731 |
hex | 280ded85d |
10752022621 has 2 divisors, whose sum is σ = 10752022622. Its totient is φ = 10752022620.
The previous prime is 10752022597. The next prime is 10752022637. The reversal of 10752022621 is 12622025701.
10752022621 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6450499225 + 4301523396 = 80315^2 + 65586^2 .
It is a cyclic number.
It is not a de Polignac number, because 10752022621 - 233 = 2162088029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10752022621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10752022661) 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 as a sum of consecutive naturals, namely, 5376011310 + 5376011311.
It is an arithmetic number, because the mean of its divisors is an integer number (5376011311).
Almost surely, 210752022621 is an apocalyptic number.
It is an amenable number.
10752022621 is a deficient number, since it is larger than the sum of its proper divisors (1).
10752022621 is an equidigital number, since it uses as much as digits as its factorization.
10752022621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 28.
The spelling of 10752022621 in words is "ten billion, seven hundred fifty-two million, twenty-two thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •