Search a number
-
+
120091215031 = 1011189021931
BaseRepresentation
bin110111111010111111…
…1101000010010110111
3102110222100210210222221
41233311333220102313
53431421322340111
6131100311303211
711450654325304
oct1576577502267
9373870723887
10120091215031
1146a263a6347
121b33637ab07
13b42b073368
145b534cc0ab
1531ccec2371
hex1bf5fe84b7

120091215031 has 4 divisors (see below), whose sum is σ = 121280237064. Its totient is φ = 118902193000.

The previous prime is 120091215007. The next prime is 120091215037. The reversal of 120091215031 is 130512190021.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130512190021 = 449290673029.

It is a cyclic number.

It is not a de Polignac number, because 120091215031 - 233 = 111501280439 is a prime.

It is a super-2 number, since 2×1200912150312 (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 = 120091214987 and 120091215005.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (120091215037) 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, 594510865 + ... + 594511066.

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

Almost surely, 2120091215031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1189022032.

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

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

Divisors: 1 101 1189021931 120091215031