Search a number
-
+
10101200101111 = 7329449562977
BaseRepresentation
bin1001001011111101111001…
…1100011001111011110111
31022202122222000002001022101
42102333132130121323313
52310444224211213421
633252232142242531
72061534104122000
oct222773634317367
938678860061271
1010101200101111
113244993134919
12117181b586447
13583701496462
1426cc877081a7
15127b4e6d8191
hex92fde719ef7

10101200101111 has 8 divisors (see below), whose sum is σ = 11779825191200. Its totient is φ = 8658171514944.

The previous prime is 10101200101103. The next prime is 10101200101147. The reversal of 10101200101111 is 11110100210101.

It is not a de Polignac number, because 10101200101111 - 23 = 10101200101103 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14724781146 + ... + 14724781831.

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

Almost surely, 210101200101111 is an apocalyptic number.

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

10101200101111 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 29449562998 (or 29449562984 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 10101200101111 its reverse (11110100210101), we get a palindrome (21211300311212).

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

Divisors: 1 7 49 343 29449562977 206146940839 1443028585873 10101200101111