Search a number
-
+
141110120032 = 25721729277659
BaseRepresentation
bin1000001101101011010…
…0011000111001100000
3111111020012120211010221
42003122310120321200
54302443142320112
6144454115332424
713123561141600
oct2033264307140
9444205524127
10141110120032
1154931a90812
12234215b1114
13103ca87705b
146b88c42c00
153a0d405e07
hex20dad18e60

141110120032 has 288 divisors, whose sum is σ = 355793407200. Its totient is φ = 54674178048.

The previous prime is 141110120023. The next prime is 141110120051. The reversal of 141110120032 is 230021011141.

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

It is a junction number, because it is equal to n+sod(n) for n = 141110119988 and 141110120015.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 214127319 + ... + 214127977.

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

Almost surely, 2141110120032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

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

Adding to 141110120032 its reverse (230021011141), we get a palindrome (371131131173).

The spelling of 141110120032 in words is "one hundred forty-one billion, one hundred ten million, one hundred twenty thousand, thirty-two".