Search a number
-
+
10130151015 = 325317261757
BaseRepresentation
bin10010110111100110…
…11101011001100111
3222010222122222202100
421123303131121213
5131221304313030
64353112143143
7506014601655
oct113363353147
928128588670
1010130151015
11432922a436
121b68697ab3
13c559598ca
146c1561dd5
153e451b360
hex25bcdd667

10130151015 has 24 divisors (see below), whose sum is σ = 18125347968. Its totient is φ = 5228464320.

The previous prime is 10130151013. The next prime is 10130151047. The reversal of 10130151015 is 51015103101.

10130151015 is a `hidden beast` number, since 10 + 130 + 1 + 510 + 15 = 666.

It is not a de Polignac number, because 10130151015 - 21 = 10130151013 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3629484 + ... + 3632273.

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

Almost surely, 210130151015 is an apocalyptic number.

10130151015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

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

The product of its (nonzero) digits is 75, while the sum is 18.

Adding to 10130151015 its reverse (51015103101), we get a palindrome (61145254116).

The spelling of 10130151015 in words is "ten billion, one hundred thirty million, one hundred fifty-one thousand, fifteen".

Divisors: 1 3 5 9 15 31 45 93 155 279 465 1395 7261757 21785271 36308785 65355813 108926355 225114467 326779065 675343401 1125572335 2026030203 3376717005 10130151015