Search a number
-
+
120102015031 = 432645110069
BaseRepresentation
bin110111111011010100…
…0110101000000110111
3102111000010010111210221
41233312220311000313
53431432103440111
6131101334555211
711451145166215
oct1576650650067
9374003114727
10120102015031
1146a31502569
121b339b08b07
13b4303850ab
145b54addcb5
1531cde07371
hex1bf6a35037

120102015031 has 12 divisors (see below), whose sum is σ = 122991314520. Its totient is φ = 117279111600.

The previous prime is 120102015029. The next prime is 120102015071. The reversal of 120102015031 is 130510201021.

It is not a de Polignac number, because 120102015031 - 21 = 120102015029 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11922865 + ... + 11932933.

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

Almost surely, 2120102015031 is an apocalyptic number.

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

120102015031 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 60, while the sum is 16.

Adding to 120102015031 its reverse (130510201021), we get a palindrome (250612216052).

The spelling of 120102015031 in words is "one hundred twenty billion, one hundred two million, fifteen thousand, thirty-one".

Divisors: 1 43 1849 6451 10069 277393 432967 11927899 18617581 64955119 2793070117 120102015031