Search a number
-
+
102038263006368 = 2531319371632632713
BaseRepresentation
bin10111001100110110100010…
…011010111000010010100000
3111101021202120222202111102210
4113030312202122320102200
5101333243330312200433
61001003421512442120
730331010164631613
oct2714664232702240
9441252528674383
10102038263006368
112a570203375a77
12b53b8479a9340
1344c222292cc90
141b2a96d2b817a
15bbe3b1a24463
hex5ccda26b84a0

102038263006368 has 768 divisors, whose sum is σ = 315064728760320. Its totient is φ = 28642585706496.

The previous prime is 102038263006181. The next prime is 102038263006391. The reversal of 102038263006368 is 863600362830201.

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

It is an unprimeable number.

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

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

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

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

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

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

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

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

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

The spelling of 102038263006368 in words is "one hundred two trillion, thirty-eight billion, two hundred sixty-three million, six thousand, three hundred sixty-eight".