Search a number
-
+
10102111120101 = 37111337731379091
BaseRepresentation
bin1001001100000001010010…
…1111101010101011100101
31022202202022111022121102110
42103000110233222223211
52311003110421320401
633252502404431233
72061565505503020
oct223002457525345
938682274277373
1010102111120101
113245310402980
121171a346a8519
1358381814a450
1426cd326d21b7
15127ba468e9d6
hex93014beaae5

10102111120101 has 256 divisors, whose sum is σ = 18967630897152. Its totient is φ = 4614241075200.

The previous prime is 10102111119943. The next prime is 10102111120147.

10102111120101 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 10102111120101 - 29 = 10102111119589 is a prime.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10102111120901) by changing a digit.

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 1111216566 + ... + 1111225656.

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

Almost surely, 210102111120101 is an apocalyptic number.

10102111120101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

10102111120101 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 9372.

The product of its (nonzero) digits is 4, while the sum is 12.

It can be divided in two parts, 1010211 and 1120101, that multiplied together give a palindrome (1131538351311).

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