Base | Representation |
---|---|
bin | 101011110100100000011… |
… | …111000111011101010101 |
3 | 101122212201212101122102122 |
4 | 223310200133013131111 |
5 | 343314134134234141 |
6 | 10223214024145325 |
7 | 430363150016555 |
oct | 53644037073525 |
9 | 11585655348378 |
10 | 3011317102421 |
11 | a61101aaa291 |
12 | 407744008245 |
13 | 18ac73362904 |
14 | a5a69d4d165 |
15 | 534e806e64b |
hex | 2bd207c7755 |
3011317102421 has 2 divisors, whose sum is σ = 3011317102422. Its totient is φ = 3011317102420.
The previous prime is 3011317102361. The next prime is 3011317102459. The reversal of 3011317102421 is 1242017131103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2956835007025 + 54482095396 = 1719545^2 + 233414^2 .
It is a cyclic number.
It is not a de Polignac number, because 3011317102421 - 218 = 3011316840277 is a prime.
It is a super-2 number, since 2×30113171024212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3011317102481) 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, 1505658551210 + 1505658551211.
It is an arithmetic number, because the mean of its divisors is an integer number (1505658551211).
Almost surely, 23011317102421 is an apocalyptic number.
It is an amenable number.
3011317102421 is a deficient number, since it is larger than the sum of its proper divisors (1).
3011317102421 is an equidigital number, since it uses as much as digits as its factorization.
3011317102421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
The spelling of 3011317102421 in words is "three trillion, eleven billion, three hundred seventeen million, one hundred two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •