Search a number
-
+
101051106010 = 2527137288231
BaseRepresentation
bin101111000011100011…
…1011000001011011010
3100122211102111001121221
41132013013120023122
53123423040343020
6114231111522254
710205066141341
oct1360707301332
9318742431557
10101051106010
1139945795658
121770198938a
1396b550156a
144c688b2b58
1529666636aa
hex17871d82da

101051106010 has 16 divisors (see below), whose sum is σ = 182563183872. Its totient is φ = 40271288400.

The previous prime is 101051105999. The next prime is 101051106011. The reversal of 101051106010 is 10601150101.

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

It is not an unprimeable number, because it can be changed into a prime (101051106011) 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 7 ways as a sum of consecutive naturals, for example, 18641406 + ... + 18646825.

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

Almost surely, 2101051106010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 37288509.

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

Adding to 101051106010 its reverse (10601150101), we get a palindrome (111652256111).

The spelling of 101051106010 in words is "one hundred one billion, fifty-one million, one hundred six thousand, ten".

Divisors: 1 2 5 10 271 542 1355 2710 37288231 74576462 186441155 372882310 10105110601 20210221202 50525553005 101051106010