Search a number
-
+
315642060246513 = 371121337594377167
BaseRepresentation
bin100011111000100110010010…
…0111000001000110111110001
31112101121002022212220220222210
41013301030210320020313301
5312332434414410342023
63035151543301122333
7123325246334012130
oct10761144470106761
91471532285826883
10315642060246513
1191634056268300
122b4996673b93a9
1310717bc3113910
1457d322b61b917
15267589363b593
hex11f1324e08df1

315642060246513 has 192 divisors, whose sum is σ = 594644926095360. Its totient is φ = 144770038110720.

The previous prime is 315642060246511. The next prime is 315642060246589.

315642060246513 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 315642060246513 - 21 = 315642060246511 is a prime.

It is a Curzon number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 69922456 + ... + 74299622.

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

Almost surely, 2315642060246513 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 3110400, while the sum is 48.

The spelling of 315642060246513 in words is "three hundred fifteen trillion, six hundred forty-two billion, sixty million, two hundred forty-six thousand, five hundred thirteen".