Base | Representation |
---|---|
bin | 10011000010110101… |
… | …10001110011001101 |
3 | 222101112220111121101 |
4 | 21201122301303031 |
5 | 131414413004034 |
6 | 4410315103101 |
7 | 511240330606 |
oct | 114132616315 |
9 | 28345814541 |
10 | 10224344269 |
11 | 43774151a7 |
12 | 1b94141a91 |
13 | c6c319369 |
14 | 6cdc80dad |
15 | 3ec925514 |
hex | 2616b1ccd |
10224344269 has 2 divisors, whose sum is σ = 10224344270. Its totient is φ = 10224344268.
The previous prime is 10224344219. The next prime is 10224344287. The reversal of 10224344269 is 96244342201.
10224344269 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., 9178598025 + 1045746244 = 95805^2 + 32338^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10224344269 is a prime.
It is a super-2 number, since 2×102243442692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10224344219) 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, 5112172134 + 5112172135.
It is an arithmetic number, because the mean of its divisors is an integer number (5112172135).
Almost surely, 210224344269 is an apocalyptic number.
It is an amenable number.
10224344269 is a deficient number, since it is larger than the sum of its proper divisors (1).
10224344269 is an equidigital number, since it uses as much as digits as its factorization.
10224344269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 37.
The spelling of 10224344269 in words is "ten billion, two hundred twenty-four million, three hundred forty-four thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •