Search a number
-
+
107215156216 = 2371914556361
BaseRepresentation
bin110001111011010000…
…1010111001111111000
3101020202000020020212201
41203312201113033320
53224034034444331
6121130504515544
710513614535240
oct1436641271770
9336660206781
10107215156216
1141519184823
121894217bbb4
13a15857844c
1452913c6b20
152bc78a3a61
hex18f68573f8

107215156216 has 16 divisors (see below), whose sum is σ = 229746763440. Its totient is φ = 45949352640.

The previous prime is 107215156207. The next prime is 107215156219. The reversal of 107215156216 is 612651512701.

It is a super-2 number, since 2×1072151562162 (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 (107215156219) by changing a digit.

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

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

Almost surely, 2107215156216 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 37.

Adding to 107215156216 its reverse (612651512701), we get a palindrome (719866668917).

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

Divisors: 1 2 4 7 8 14 28 56 1914556361 3829112722 7658225444 13401894527 15316450888 26803789054 53607578108 107215156216