Search a number
-
+
102015216052 = 2235277231019
BaseRepresentation
bin101111100000010010…
…1001010100110110100
3100202022121121220222021
41133000211022212310
53132411343403202
6114510512042524
710241014012651
oct1370045124664
9322277556867
10102015216052
113a29aa25812
1217930833444
13980a183889
144d1a95ac28
1529c1105a37
hex17c094a9b4

102015216052 has 12 divisors (see below), whose sum is σ = 178577269920. Its totient is φ = 50993138936.

The previous prime is 102015216031. The next prime is 102015216053. The reversal of 102015216052 is 250612510201.

It is a super-2 number, since 2×1020152160522 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3601402 + ... + 3629617.

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

Almost surely, 2102015216052 is an apocalyptic number.

It is an amenable number.

102015216052 is a deficient number, since it is larger than the sum of its proper divisors (76562053868).

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

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

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

The product of its (nonzero) digits is 1200, while the sum is 25.

Adding to 102015216052 its reverse (250612510201), we get a palindrome (352627726253).

The spelling of 102015216052 in words is "one hundred two billion, fifteen million, two hundred sixteen thousand, fifty-two".

Divisors: 1 2 4 3527 7054 14108 7231019 14462038 28924076 25503804013 51007608026 102015216052