Search a number
-
+
126655901064 = 2332711219281389
BaseRepresentation
bin111010111110101000…
…1111010110110001000
3110002220212102102021200
41311331101322312020
54033342402313224
6134103535304200
712102436252530
oct1657521726610
9402825372250
10126655901064
1149794a55100
122066897b060
13bc36122074
1461b72d04c0
15346449e5c9
hex1d7d47ad88

126655901064 has 576 divisors, whose sum is σ = 456373008000. Its totient is φ = 30975436800.

The previous prime is 126655901063. The next prime is 126655901069. The reversal of 126655901064 is 460109556621.

126655901064 is a `hidden beast` number, since 1 + 26 + 6 + 559 + 0 + 10 + 64 = 666.

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

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 325593382 + ... + 325593770.

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

Almost surely, 2126655901064 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 388800, while the sum is 45.

The spelling of 126655901064 in words is "one hundred twenty-six billion, six hundred fifty-five million, nine hundred one thousand, sixty-four".