Search a number
-
+
101014130110 = 2510101413011
BaseRepresentation
bin101111000010011101…
…0010100110110111110
3100122201211220111020011
41132010322110312332
53123334104130420
6114223311213434
710204136640025
oct1360472246676
9318654814204
10101014130110
1139926930063
12176b151727a
1396aa95632a
144c63a098bc
1529632ac95a
hex1784e94dbe

101014130110 has 8 divisors (see below), whose sum is σ = 181825434216. Its totient is φ = 40405652040.

The previous prime is 101014130093. The next prime is 101014130183. The reversal of 101014130110 is 11031410101.

It is a happy number.

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

It is a super-2 number, since 2×1010141301102 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2101014130110 is an apocalyptic number.

101014130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 10101413018.

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

Adding to 101014130110 its reverse (11031410101), we get a palindrome (112045540211).

The spelling of 101014130110 in words is "one hundred one billion, fourteen million, one hundred thirty thousand, one hundred ten".

Divisors: 1 2 5 10 10101413011 20202826022 50507065055 101014130110