Base | Representation |
---|---|
bin | 10011000000001101… |
… | …00010011100010101 |
3 | 222100000100120102111 |
4 | 21200012202130111 |
5 | 131343234330034 |
6 | 4404205511021 |
7 | 510551534644 |
oct | 114006423425 |
9 | 28300316374 |
10 | 10202261269 |
11 | 4365a01992 |
12 | 1b88872471 |
13 | c67886ab5 |
14 | 6cad7335b |
15 | 3eaa12364 |
hex | 2601a2715 |
10202261269 has 2 divisors, whose sum is σ = 10202261270. Its totient is φ = 10202261268.
The previous prime is 10202261263. The next prime is 10202261309. The reversal of 10202261269 is 96216220201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9552521169 + 649740100 = 97737^2 + 25490^2 .
It is a cyclic number.
It is not a de Polignac number, because 10202261269 - 213 = 10202253077 is a prime.
It is a super-2 number, since 2×102022612692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10202261269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10202261263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101130634 + 5101130635.
It is an arithmetic number, because the mean of its divisors is an integer number (5101130635).
Almost surely, 210202261269 is an apocalyptic number.
It is an amenable number.
10202261269 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202261269 is an equidigital number, since it uses as much as digits as its factorization.
10202261269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 10202261269 in words is "ten billion, two hundred two million, two hundred sixty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •