Search a number
-
+
102012009371 = 1512137316133
BaseRepresentation
bin101111100000001100…
…0111011101110011011
3100202022101121000020022
41133000120323232123
53132410033244441
6114510315221055
710240644526016
oct1370030735633
9322271530208
10102012009371
113a299135568
121792b74778b
13980960012c
144d1a36437d
1529c0bc084b
hex17c063bb9b

102012009371 has 8 divisors (see below), whose sum is σ = 102735962784. Its totient is φ = 101288692800.

The previous prime is 102012009367. The next prime is 102012009377. The reversal of 102012009371 is 173900210201.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 102012009371 - 22 = 102012009367 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 102012009371.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164621 + ... + 480753.

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

Almost surely, 2102012009371 is an apocalyptic number.

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

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

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

The sum of its prime factors is 318421.

The product of its (nonzero) digits is 756, while the sum is 26.

Adding to 102012009371 its reverse (173900210201), we get a palindrome (275912219572).

The spelling of 102012009371 in words is "one hundred two billion, twelve million, nine thousand, three hundred seventy-one".

Divisors: 1 151 2137 316133 322687 47736083 675576221 102012009371