Search a number
-
+
1410020933 is a prime number
BaseRepresentation
bin101010000001011…
…0011011001000101
310122021012111002112
41110002303121011
510341431132213
6351525350405
746640660126
oct12402633105
93567174075
101410020933
11663a13662
12334268405
13196179a19
14d53a004d
1583bc3ea8
hex540b3645

1410020933 has 2 divisors, whose sum is σ = 1410020934. Its totient is φ = 1410020932.

The previous prime is 1410020923. The next prime is 1410020939. The reversal of 1410020933 is 3390200141.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 856030564 + 553990369 = 29258^2 + 23537^2 .

It is a cyclic number.

It is not a de Polignac number, because 1410020933 - 210 = 1410019909 is a prime.

It is a super-3 number, since 3×14100209333 (a number of 28 digits) contains 333 as substring.

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

It is a congruent number.

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

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

Almost surely, 21410020933 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 23.

The square root of 1410020933 is about 37550.2454452697. The cubic root of 1410020933 is about 1121.3517196322.

The spelling of 1410020933 in words is "one billion, four hundred ten million, twenty thousand, nine hundred thirty-three".