Search a number
-
+
10390271149664 = 2577913118732393
BaseRepresentation
bin1001011100110010110001…
…1010111100011001100000
31100210022002212020211002222
42113030230122330121200
52330213233403242124
634033120310130212
72121446414363210
oct227145432743140
940708085224088
1010390271149664
11334654221013a
1211b9854950968
135a4a4c015593
1427cc6b192240
1513041c68e25e
hex9732c6bc660

10390271149664 has 192 divisors, whose sum is σ = 23877463357440. Its totient is φ = 4358892994560.

The previous prime is 10390271149649. The next prime is 10390271149691. The reversal of 10390271149664 is 46694117209301.

It is a happy number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4341942452 + ... + 4341944844.

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

Almost surely, 210390271149664 is an apocalyptic number.

10390271149664 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 10390271149664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11938731678720).

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

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

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

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

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

The product of its (nonzero) digits is 1959552, while the sum is 53.

The spelling of 10390271149664 in words is "ten trillion, three hundred ninety billion, two hundred seventy-one million, one hundred forty-nine thousand, six hundred sixty-four".