Base | Representation |
---|---|
bin | 1001010011000100011000… |
… | …1101111110001100111001 |
3 | 1100012022212101211211220212 |
4 | 2110301012031332030321 |
5 | 2314444103224412444 |
6 | 33424250124400505 |
7 | 2103413301123344 |
oct | 224610615761471 |
9 | 40168771754825 |
10 | 10223200232249 |
11 | 32916a9016084 |
12 | 11913a90a6135 |
13 | 592074b72774 |
14 | 274b3c54145b |
15 | 12ade007a19e |
hex | 94c4637e339 |
10223200232249 has 2 divisors, whose sum is σ = 10223200232250. Its totient is φ = 10223200232248.
The previous prime is 10223200232177. The next prime is 10223200232251. The reversal of 10223200232249 is 94223200232201.
10223200232249 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., 5479494452224 + 4743705780025 = 2340832^2 + 2178005^2 .
It is a cyclic number.
It is not a de Polignac number, because 10223200232249 - 236 = 10154480755513 is a prime.
Together with 10223200232251, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10223200234249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111600116124 + 5111600116125.
It is an arithmetic number, because the mean of its divisors is an integer number (5111600116125).
Almost surely, 210223200232249 is an apocalyptic number.
It is an amenable number.
10223200232249 is a deficient number, since it is larger than the sum of its proper divisors (1).
10223200232249 is an equidigital number, since it uses as much as digits as its factorization.
10223200232249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 32.
The spelling of 10223200232249 in words is "ten trillion, two hundred twenty-three billion, two hundred million, two hundred thirty-two thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •