Search a number
-
+
101272862145 = 357213217199241
BaseRepresentation
bin101111001010001010…
…1010011110111000001
3100200101212202102212010
41132110111103313001
53124401323042040
6114305112523133
710213431060600
oct1362425236701
9320355672763
10101272862145
1139a49988294
12177640b04a9
13971c435400
144c8a119a37
15297ad68e80
hex1794553dc1

101272862145 has 288 divisors, whose sum is σ = 218099692800. Its totient is φ = 39852933120.

The previous prime is 101272862083. The next prime is 101272862153. The reversal of 101272862145 is 541268272101.

It is not a de Polignac number, because 101272862145 - 28 = 101272861889 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (39).

It is an unprimeable number.

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 287 ways as a sum of consecutive naturals, for example, 420219225 + ... + 420219465.

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

Almost surely, 2101272862145 is an apocalyptic number.

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

It is an amenable number.

101272862145 is an abundant number, since it is smaller than the sum of its proper divisors (116826830655).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 505 (or 485 counting only the distinct ones).

The product of its (nonzero) digits is 53760, while the sum is 39.

The spelling of 101272862145 in words is "one hundred one billion, two hundred seventy-two million, eight hundred sixty-two thousand, one hundred forty-five".