Search a number
-
+
10115152451313 = 37136179107181397
BaseRepresentation
bin1001001100110001111000…
…0100011001011011110001
31022210222222100212212122120
42103030132010121123301
52311211313011420223
633302500433424453
72062536623131560
oct223143604313361
938728870785576
1010115152451313
11324a8a2948058
12117447410b129
13584b15c60890
1426d80c739bd7
151281b9557be3
hex9331e1196f1

10115152451313 has 256 divisors, whose sum is σ = 17383527383040. Its totient is φ = 5091923865600.

The previous prime is 10115152451297. The next prime is 10115152451321. The reversal of 10115152451313 is 31315425151101.

It is not a de Polignac number, because 10115152451313 - 24 = 10115152451297 is a prime.

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

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

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 25478973231 + ... + 25478973627.

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

Almost surely, 210115152451313 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 848.

The product of its (nonzero) digits is 9000, while the sum is 33.

The spelling of 10115152451313 in words is "ten trillion, one hundred fifteen billion, one hundred fifty-two million, four hundred fifty-one thousand, three hundred thirteen".