Search a number
-
+
110201110222002 = 2318366851703667
BaseRepresentation
bin11001000011101000110010…
…000001110101010010110010
3112110012010022211220120212220
4121003220302001311102302
5103421013333204101002
61030213405141501510
732132524146302442
oct3103506201652262
9473163284816786
10110201110222002
1132128034868638
1210439868a11896
134964bc660cc17
141d2da95662122
15cb18b538b7bc
hex643a320754b2

110201110222002 has 8 divisors (see below), whose sum is σ = 220402220444016. Its totient is φ = 36733703407332.

The previous prime is 110201110221973. The next prime is 110201110222009. The reversal of 110201110222002 is 200222011102011.

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

110201110222002 is an admirable number.

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

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

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

Almost surely, 2110201110222002 is an apocalyptic number.

110201110222002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

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

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

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

The sum of its prime factors is 18366851703672.

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

Adding to 110201110222002 its reverse (200222011102011), we get a palindrome (310423121324013).

The spelling of 110201110222002 in words is "one hundred ten trillion, two hundred one billion, one hundred ten million, two hundred twenty-two thousand, two".

Divisors: 1 2 3 6 18366851703667 36733703407334 55100555111001 110201110222002