Search a number
BaseRepresentation
bin101111001000010011…
…0010001011111001011
3100200020111211212120100
41132100212101133023
53124234302400021
6114254553500443
710212040335264
oct1362046213713
9320214755510
10101210200011
1139a175792a8
1217747111723
13970c46581b
144c81a8796b
1529755dc626
hex17909917cb

101210200011 has 12 divisors (see below), whose sum is σ = 146626321192. Its totient is φ = 67273246656.

The previous prime is 101210199997. The next prime is 101210200079. The reversal of 101210200011 is 110002012101.

Adding to 101210200011 its reverse (110002012101), we get a palindrome (211212212112).

It is a happy number.

It is not a de Polignac number, because 101210200011 - 26 = 101210199947 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 101210199966 and 101210200002.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16681801 + ... + 16687866.

Almost surely, 2101210200011 is an apocalyptic number.

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

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

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

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

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

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