Search a number
-
+
110141301400032 = 25372367793893461
BaseRepresentation
bin11001000010110001000101…
…001001010010000111100000
3112102222101221200001122002110
4121002301011021102013200
5103414023341124300112
61030130114303115320
732125306060560210
oct3102610511220740
9472871850048073
10110141301400032
1132104733298451
121042a156ba2b40
13495c38466b736
141d2ac20336240
15cb00647ee13c
hex642c452521e0

110141301400032 has 768 divisors, whose sum is σ = 355379473612800. Its totient is φ = 29192431656960.

The previous prime is 110141301400027. The next prime is 110141301400033. The reversal of 110141301400032 is 230004103141011.

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

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2110141301400032 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 288, while the sum is 21.

Adding to 110141301400032 its reverse (230004103141011), we get a palindrome (340145404541043).

The spelling of 110141301400032 in words is "one hundred ten trillion, one hundred forty-one billion, three hundred one million, four hundred thousand, thirty-two".