Base | Representation |
---|---|
bin | 101101010101100010010… |
… | …110000000001010011001 |
3 | 102000211122122012102021111 |
4 | 231111202112000022121 |
5 | 402021021303141401 |
6 | 10343124055340321 |
7 | 441042011316163 |
oct | 55254226001231 |
9 | 12024578172244 |
10 | 3115501224601 |
11 | aa13052472a7 |
12 | 42397b0816a1 |
13 | 197a3797bc9c |
14 | aab10971933 |
15 | 5609479de51 |
hex | 2d562580299 |
3115501224601 has 2 divisors, whose sum is σ = 3115501224602. Its totient is φ = 3115501224600.
The previous prime is 3115501224599. The next prime is 3115501224611. The reversal of 3115501224601 is 1064221055113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3095403909376 + 20097315225 = 1759376^2 + 141765^2 .
It is a cyclic number.
It is not a de Polignac number, because 3115501224601 - 21 = 3115501224599 is a prime.
Together with 3115501224599, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3115501224611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1557750612300 + 1557750612301.
It is an arithmetic number, because the mean of its divisors is an integer number (1557750612301).
Almost surely, 23115501224601 is an apocalyptic number.
It is an amenable number.
3115501224601 is a deficient number, since it is larger than the sum of its proper divisors (1).
3115501224601 is an equidigital number, since it uses as much as digits as its factorization.
3115501224601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 3115501224601 its reverse (1064221055113), we get a palindrome (4179722279714).
The spelling of 3115501224601 in words is "three trillion, one hundred fifteen billion, five hundred one million, two hundred twenty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •