Search a number
-
+
101420621 is a prime number
BaseRepresentation
bin1100000101110…
…00111001001101
321001211200221022
412002320321031
5201430424441
614021443525
72341026641
oct602707115
9231750838
10101420621
11522818a5
1229b705a5
1318020303
14d680c21
158d8584b
hex60b8e4d

101420621 has 2 divisors, whose sum is σ = 101420622. Its totient is φ = 101420620.

The previous prime is 101420611. The next prime is 101420633. The reversal of 101420621 is 126024101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96628900 + 4791721 = 9830^2 + 2189^2 .

It is a cyclic number.

It is not a de Polignac number, because 101420621 - 222 = 97226317 is a prime.

It is a super-2 number, since 2×1014206212 = 20572284728051282, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 101420621.

It is a congruent number.

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

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

Almost surely, 2101420621 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 96, while the sum is 17.

The square root of 101420621 is about 10070.7805556471. The cubic root of 101420621 is about 466.3465359412.

Adding to 101420621 its reverse (126024101), we get a palindrome (227444722).

The spelling of 101420621 in words is "one hundred one million, four hundred twenty thousand, six hundred twenty-one".