Search a number
-
+
127032192000 = 210335375989
BaseRepresentation
bin111011001001110110…
…1010110110000000000
3110010220002110222102000
41312103231112300000
54040130220121000
6134205140424000
712114655546620
oct1662355266000
9403802428360
10127032192000
11499683a704a
12207529a8000
13bc96081c1c
146211282880
15348752d000
hex1d93b56c00

127032192000 has 1408 divisors, whose sum is σ = 551805696000. Its totient is φ = 28223078400.

The previous prime is 127032191999. The next prime is 127032192041. The reversal of 127032192000 is 291230721.

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

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

It is an unprimeable number.

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, 1427327956 + ... + 1427328044.

Almost surely, 2127032192000 is an apocalyptic number.

127032192000 is a gapful number since it is divisible by the number (10) 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 127032192000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (275902848000).

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

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

127032192000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 1512, while the sum is 27.

The spelling of 127032192000 in words is "one hundred twenty-seven billion, thirty-two million, one hundred ninety-two thousand".