Search a number
-
+
315305460325147 = 1289244612459523
BaseRepresentation
bin100011110110001001100010…
…1111101010101101100011011
31112100101220111122210020210111
41013230103011331111230123
5312311431040320401042
63034333155004425151
7123262032145621405
oct10754230575255433
91470356448706714
10315305460325147
11915143273a2406
122b4443888481b7
13106c223c785306
1457c0c196d9b75
15266bc42c16517
hex11ec4c5f55b1b

315305460325147 has 4 divisors (see below), whose sum is σ = 315550072785960. Its totient is φ = 315060847864336.

The previous prime is 315305460325067. The next prime is 315305460325153. The reversal of 315305460325147 is 741523064503513.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 315305460325147 - 27 = 315305460325019 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 315305460325147.

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

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

Almost surely, 2315305460325147 is an apocalyptic number.

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

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

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

The sum of its prime factors is 244612460812.

The product of its (nonzero) digits is 4536000, while the sum is 49.

The spelling of 315305460325147 in words is "three hundred fifteen trillion, three hundred five billion, four hundred sixty million, three hundred twenty-five thousand, one hundred forty-seven".

Divisors: 1 1289 244612459523 315305460325147