Search a number
-
+
102709019952 = 2436721117312
BaseRepresentation
bin101111110100111101…
…1110100010100110000
3100211002222010211000000
41133221323310110300
53140322002114302
6115103414430000
710264140156600
oct1375173642460
9324088124000
10102709019952
113a616622970
1217aa5062300
1398bab33926
144d84b60c00
152a11ea231c
hex17e9ef4530

102709019952 has 1260 divisors, whose sum is σ = 414247323528. Its totient is φ = 24298444800.

The previous prime is 102709019951. The next prime is 102709019957. The reversal of 102709019952 is 259910907201.

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

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

It is a polite number, since it can be written in 251 ways as a sum of consecutive naturals, for example, 3313194177 + ... + 3313194207.

Almost surely, 2102709019952 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 102709019952 in words is "one hundred two billion, seven hundred nine million, nineteen thousand, nine hundred fifty-two".