Base | Representation |
---|---|
bin | 10011000010101001… |
… | …11101110110010001 |
3 | 222101110001002201212 |
4 | 21201110331312101 |
5 | 131414020231003 |
6 | 4410222305505 |
7 | 511221354065 |
oct | 114124756621 |
9 | 28343032655 |
10 | 10222820753 |
11 | 43765745a2 |
12 | 1b93728295 |
13 | c6bc04a82 |
14 | 6cd9a5aa5 |
15 | 3ec723dd8 |
hex | 26153dd91 |
10222820753 has 2 divisors, whose sum is σ = 10222820754. Its totient is φ = 10222820752.
The previous prime is 10222820683. The next prime is 10222820779. The reversal of 10222820753 is 35702822201.
10222820753 is digitally balanced in base 2 and base 3, because in such bases 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., 8906074384 + 1316746369 = 94372^2 + 36287^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222820753 - 28 = 10222820497 is a prime.
It is a super-3 number, since 3×102228207533 (a number of 31 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10222820053) 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, 5111410376 + 5111410377.
It is an arithmetic number, because the mean of its divisors is an integer number (5111410377).
Almost surely, 210222820753 is an apocalyptic number.
It is an amenable number.
10222820753 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222820753 is an equidigital number, since it uses as much as digits as its factorization.
10222820753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13440, while the sum is 32.
The spelling of 10222820753 in words is "ten billion, two hundred twenty-two million, eight hundred twenty thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •