Search a number
-
+
101020001989433 is a prime number
BaseRepresentation
bin10110111110000010001101…
…010101010111001100111001
3111020200102021122000022000012
4112332002031111113030321
5101220102431002130213
6554503540453151305
730164311552042262
oct2676021525271471
9436612248008005
10101020001989433
112a20838459a84a
12b3b642a32b535
13444a1b7334a97
141ad35738db969
15ba2b670464a8
hex5be08d557339

101020001989433 has 2 divisors, whose sum is σ = 101020001989434. Its totient is φ = 101020001989432.

The previous prime is 101020001989429. The next prime is 101020001989469. The reversal of 101020001989433 is 334989100020101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 98045801668864 + 2974200320569 = 9901808^2 + 1724587^2 .

It is a cyclic number.

It is not a de Polignac number, because 101020001989433 - 22 = 101020001989429 is a prime.

It is a super-2 number, since 2×1010200019894332 (a number of 29 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (101020001919433) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510000994716 + 50510000994717.

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

Almost surely, 2101020001989433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 46656, while the sum is 41.

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