Search a number
-
+
101200011001 = 347291642683
BaseRepresentation
bin101111000111111111…
…1011001111011111001
3100200012210200012212121
41132033333121323321
53124224200323001
6114253551241241
710211554620565
oct1361777317371
9320183605777
10101200011001
1139a1184a131
1217743819221
13970a308c1b
144c805946a5
1529747786a1
hex178ffd9ef9

101200011001 has 4 divisors (see below), whose sum is σ = 101491654032. Its totient is φ = 100908367972.

The previous prime is 101200010983. The next prime is 101200011041. The reversal of 101200011001 is 100110002101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 101200011001 - 215 = 101199978233 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145820995 + ... + 145821688.

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

Almost surely, 2101200011001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 291643030.

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

Adding to 101200011001 its reverse (100110002101), we get a palindrome (201310013102).

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

Divisors: 1 347 291642683 101200011001