Search a number
-
+
102697550592 = 2837132950671
BaseRepresentation
bin101111110100101000…
…0000100001100000000
3100211002011120002222220
41133221100010030000
53140311033104332
6115102324531040
710263640530330
oct1375120041400
9324064502886
10102697550592
113a6100a985a
1217aa1250a80
1398b8649320
144d834170c0
152a10e88d2c
hex17e9404300

102697550592 has 288 divisors, whose sum is σ = 348007188480. Its totient is φ = 26150584320.

The previous prime is 102697550581. The next prime is 102697550611. The reversal of 102697550592 is 295055796201.

It is a happy number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

Almost surely, 2102697550592 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1701000, while the sum is 51.

The spelling of 102697550592 in words is "one hundred two billion, six hundred ninety-seven million, five hundred fifty thousand, five hundred ninety-two".