Search a number
-
+
10363880269 is a prime number
BaseRepresentation
bin10011010011011110…
…00100001101001101
3222202021110200000101
421221233010031031
5132211123132034
64432221531101
7514553346241
oct115157041515
928667420011
1010363880269
11443915a706
122012a13a91
13c921c3442
14704604421
15409cd9514
hex269bc434d

10363880269 has 2 divisors, whose sum is σ = 10363880270. Its totient is φ = 10363880268.

The previous prime is 10363880237. The next prime is 10363880273. The reversal of 10363880269 is 96208836301.

10363880269 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., 5950271044 + 4413609225 = 77138^2 + 66435^2 .

It is a cyclic number.

It is not a de Polignac number, because 10363880269 - 25 = 10363880237 is a prime.

It is a super-3 number, since 3×103638802693 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10363980269) 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, 5181940134 + 5181940135.

It is an arithmetic number, because the mean of its divisors is an integer number (5181940135).

Almost surely, 210363880269 is an apocalyptic number.

It is an amenable number.

10363880269 is a deficient number, since it is larger than the sum of its proper divisors (1).

10363880269 is an equidigital number, since it uses as much as digits as its factorization.

10363880269 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 373248, while the sum is 46.

The spelling of 10363880269 in words is "ten billion, three hundred sixty-three million, eight hundred eighty thousand, two hundred sixty-nine".