Search a number
-
+
101364215133 = 3531390745841
BaseRepresentation
bin101111001100111000…
…1110010110101011101
3100200122020122122121010
41132121301302311131
53130043214341013
6114322134525433
710215620420046
oct1363161626535
9320566578533
10101364215133
1139a96503125
121778a806879
13973533c12c
144c982d98cd
152983db17c3
hex1799c72d5d

101364215133 has 16 divisors (see below), whose sum is σ = 137715235776. Its totient is φ = 66294908160.

The previous prime is 101364215087. The next prime is 101364215159. The reversal of 101364215133 is 331512463101.

It is not a de Polignac number, because 101364215133 - 212 = 101364211037 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 101364215133.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2188293 + ... + 2234133.

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

Almost surely, 2101364215133 is an apocalyptic number.

It is an amenable number.

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

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

101364215133 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 59804.

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

Adding to 101364215133 its reverse (331512463101), we get a palindrome (432876678234).

The spelling of 101364215133 in words is "one hundred one billion, three hundred sixty-four million, two hundred fifteen thousand, one hundred thirty-three".

Divisors: 1 3 53 159 13907 41721 45841 137523 737071 2211213 2429573 7288719 637510787 1912532361 33788071711 101364215133