Search a number
-
+
101020110211151 is a prime number
BaseRepresentation
bin10110111110000010010011…
…110010001100100001001111
3111020200102120011122112021222
4112332002103302030201033
5101220103141203224101
6554503555320513555
730164314334646425
oct2676022362144117
9436612504575258
10101020110211151
112a20842a69738a
12b3b645a61b8bb
13444a2038968c1
141ad358402d115
15ba2b717c201b
hex5be093c8c84f

101020110211151 has 2 divisors, whose sum is σ = 101020110211152. Its totient is φ = 101020110211150.

The previous prime is 101020110211117. The next prime is 101020110211253. The reversal of 101020110211151 is 151112011020101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101020110211151 - 210 = 101020110210127 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2101020110211151 is an apocalyptic number.

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

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

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

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

Adding to 101020110211151 its reverse (151112011020101), we get a palindrome (252132121231252).

The spelling of 101020110211151 in words is "one hundred one trillion, twenty billion, one hundred ten million, two hundred eleven thousand, one hundred fifty-one".