Base | Representation |
---|---|
bin | 101101010011010110010… |
… | …110110111100101100001 |
3 | 102000121120221221000202122 |
4 | 231103112112313211201 |
5 | 402001214034011002 |
6 | 10342055041154025 |
7 | 440626552560602 |
oct | 55232626674541 |
9 | 12017527830678 |
10 | 3113152641377 |
11 | aa030a562a29 |
12 | 42342462b915 |
13 | 19775222657c |
14 | aa96aa97da9 |
15 | 55ea84d26a2 |
hex | 2d4d65b7961 |
3113152641377 has 2 divisors, whose sum is σ = 3113152641378. Its totient is φ = 3113152641376.
The previous prime is 3113152641121. The next prime is 3113152641449. The reversal of 3113152641377 is 7731462513113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2537024582416 + 576128058961 = 1592804^2 + 759031^2 .
It is a cyclic number.
It is not a de Polignac number, because 3113152641377 - 28 = 3113152641121 is a prime.
It is a super-3 number, since 3×31131526413773 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (3113152647377) 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 as a sum of consecutive naturals, namely, 1556576320688 + 1556576320689.
It is an arithmetic number, because the mean of its divisors is an integer number (1556576320689).
Almost surely, 23113152641377 is an apocalyptic number.
It is an amenable number.
3113152641377 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113152641377 is an equidigital number, since it uses as much as digits as its factorization.
3113152641377 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 317520, while the sum is 44.
The spelling of 3113152641377 in words is "three trillion, one hundred thirteen billion, one hundred fifty-two million, six hundred forty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •