Search a number
-
+
101415120001 = 1359132223103
BaseRepresentation
bin101111001110011001…
…1111110110010000001
3100200202210102212221121
41132130303332302001
53130144232320001
6114331153552241
710220106203536
oct1363463766201
9320683385847
10101415120001
113a012211768
12177a3875681
139742a53360
144ca0d8ad8d
1529885b96a1
hex179ccfec81

101415120001 has 8 divisors (see below), whose sum is σ = 111067407360. Its totient is φ = 92027278992.

The previous prime is 101415119977. The next prime is 101415120007. The reversal of 101415120001 is 100021514101.

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

It is a cyclic number.

It is not a de Polignac number, because 101415120001 - 27 = 101415119873 is a prime.

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

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

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

Almost surely, 2101415120001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 132223175.

The product of its (nonzero) digits is 40, while the sum is 16.

Adding to 101415120001 its reverse (100021514101), we get a palindrome (201436634102).

The spelling of 101415120001 in words is "one hundred one billion, four hundred fifteen million, one hundred twenty thousand, one".

Divisors: 1 13 59 767 132223103 1718900339 7801163077 101415120001