Search a number
-
+
10483949141 is a prime number
BaseRepresentation
bin10011100001110010…
…00101111001010101
31000001122101210112122
421300321011321111
5132432342333031
64452151225325
7520542045251
oct116071057125
930048353478
1010483949141
11449aa09186
122047078245
13cb1042803
1471653b261
1541560547b
hex270e45e55

10483949141 has 2 divisors, whose sum is σ = 10483949142. Its totient is φ = 10483949140.

The previous prime is 10483949137. The next prime is 10483949167. The reversal of 10483949141 is 14194938401.

10483949141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10191710116 + 292239025 = 100954^2 + 17095^2 .

It is a cyclic number.

It is not a de Polignac number, because 10483949141 - 22 = 10483949137 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10483949092 and 10483949101.

It is a congruent number.

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

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

Almost surely, 210483949141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 124416, while the sum is 44.

The spelling of 10483949141 in words is "ten billion, four hundred eighty-three million, nine hundred forty-nine thousand, one hundred forty-one".