Base | Representation |
---|---|
bin | 10011000001001010… |
… | …10010111111011001 |
3 | 222100120112020000111 |
4 | 21200211102333121 |
5 | 131402320340231 |
6 | 4405054404321 |
7 | 511010216512 |
oct | 114045227731 |
9 | 28316466014 |
10 | 10210324441 |
11 | 436a509969 |
12 | 1b8b5006a1 |
13 | c6944abc5 |
14 | 6cc071a09 |
15 | 3eb5a64b1 |
hex | 260952fd9 |
10210324441 has 2 divisors, whose sum is σ = 10210324442. Its totient is φ = 10210324440.
The previous prime is 10210324391. The next prime is 10210324447. The reversal of 10210324441 is 14442301201.
It is a happy number.
10210324441 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., 6625308816 + 3585015625 = 81396^2 + 59875^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10210324441 is a prime.
It is not a weakly prime, because it can be changed into another prime (10210324447) 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, 5105162220 + 5105162221.
It is an arithmetic number, because the mean of its divisors is an integer number (5105162221).
Almost surely, 210210324441 is an apocalyptic number.
It is an amenable number.
10210324441 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210324441 is an equidigital number, since it uses as much as digits as its factorization.
10210324441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 10210324441 its reverse (14442301201), we get a palindrome (24652625642).
The spelling of 10210324441 in words is "ten billion, two hundred ten million, three hundred twenty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •