Base | Representation |
---|---|
bin | 100011110110001101100101… |
… | …0101111100101010111101011 |
3 | 1112100102201212220022210122112 |
4 | 1013230123022233211113223 |
5 | 312312101314404240021 |
6 | 3034341151205312535 |
7 | 123262460045340641 |
oct | 10754331257452753 |
9 | 1470381786283575 |
10 | 315314130540011 |
11 | 91517a76516139 |
12 | 2b445ba840574b |
13 | 106c2cc1b09575 |
14 | 57c13dcdc7191 |
15 | 266c09de9dd5b |
hex | 11ec6cabe55eb |
315314130540011 has 2 divisors, whose sum is σ = 315314130540012. Its totient is φ = 315314130540010.
The previous prime is 315314130539977. The next prime is 315314130540067. The reversal of 315314130540011 is 110045031413513.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-315314130540011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 315314130540011.
It is not a weakly prime, because it can be changed into another prime (315314130540911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157657065270005 + 157657065270006.
It is an arithmetic number, because the mean of its divisors is an integer number (157657065270006).
Almost surely, 2315314130540011 is an apocalyptic number.
315314130540011 is a deficient number, since it is larger than the sum of its proper divisors (1).
315314130540011 is an equidigital number, since it uses as much as digits as its factorization.
315314130540011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 315314130540011 its reverse (110045031413513), we get a palindrome (425359161953524).
The spelling of 315314130540011 in words is "three hundred fifteen trillion, three hundred fourteen billion, one hundred thirty million, five hundred forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •