Search a number
-
+
101000130115 = 523878262001
BaseRepresentation
bin101111000010000010…
…0111010111001000011
3100122200212120012211211
41132010010322321003
53123322013130430
6114222051150551
710203606640513
oct1360404727103
9318625505754
10101000130115
1139919a38715
12176a88a5457
1396a7a93c01
144c61c03843
152961e4472a
hex178413ae43

101000130115 has 8 divisors (see below), whose sum is σ = 126469728288. Its totient is φ = 77287056000.

The previous prime is 101000130107. The next prime is 101000130131. The reversal of 101000130115 is 511031000101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 101000130115 - 23 = 101000130107 is a prime.

It is a Duffinian number.

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

It is an unprimeable number.

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

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

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

Almost surely, 2101000130115 is an apocalyptic number.

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

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

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

The sum of its prime factors is 878262029.

The product of its (nonzero) digits is 15, while the sum is 13.

Adding to 101000130115 its reverse (511031000101), we get a palindrome (612031130216).

The spelling of 101000130115 in words is "one hundred one billion, one hundred thirty thousand, one hundred fifteen".

Divisors: 1 5 23 115 878262001 4391310005 20200026023 101000130115