Search a number
-
+
101201311010310 = 235771109431144479
BaseRepresentation
bin10111000000101011000100…
…001100011000111000000110
3111021022202021100220212022120
4113000223010030120320012
5101231040241104312220
6555123123534510410
730213360554223630
oct2700530414307006
9437282240825276
10101201311010310
112a278264830765
12b4255aa365406
1344613202222a4
141adc2534c5a50
15ba7729622a40
hex5c0ac4318e06

101201311010310 has 256 divisors, whose sum is σ = 284733879091200. Its totient is φ = 22544115955200.

The previous prime is 101201311010299. The next prime is 101201311010311. The reversal of 101201311010310 is 13010113102101.

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

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 700384651 + ... + 700529129.

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

Almost surely, 2101201311010310 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 101201311010310, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142366939545600).

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

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

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

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

The sum of its prime factors is 145107.

The product of its (nonzero) digits is 18, while the sum is 15.

Adding to 101201311010310 its reverse (13010113102101), we get a palindrome (114211424112411).

The spelling of 101201311010310 in words is "one hundred one trillion, two hundred one billion, three hundred eleven million, ten thousand, three hundred ten".