Base | Representation |
---|---|
bin | 10010101100101001… |
… | …11011001000101101 |
3 | 221220120202110100101 |
4 | 21112110323020231 |
5 | 131024243312034 |
6 | 4340030431101 |
7 | 503520542632 |
oct | 112624731055 |
9 | 27816673311 |
10 | 10038260269 |
11 | 4291377574 |
12 | 1b41962491 |
13 | c3c8c519b |
14 | 6b3282189 |
15 | 3db419514 |
hex | 25653b22d |
10038260269 has 2 divisors, whose sum is σ = 10038260270. Its totient is φ = 10038260268.
The previous prime is 10038260209. The next prime is 10038260299. The reversal of 10038260269 is 96206283001.
10038260269 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., 9842624100 + 195636169 = 99210^2 + 13987^2 .
It is a cyclic number.
It is not a de Polignac number, because 10038260269 - 29 = 10038259757 is a prime.
It is a super-2 number, since 2×100382602692 (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 (10038260209) 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, 5019130134 + 5019130135.
It is an arithmetic number, because the mean of its divisors is an integer number (5019130135).
Almost surely, 210038260269 is an apocalyptic number.
It is an amenable number.
10038260269 is a deficient number, since it is larger than the sum of its proper divisors (1).
10038260269 is an equidigital number, since it uses as much as digits as its factorization.
10038260269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 10038260269 in words is "ten billion, thirty-eight million, two hundred sixty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •