Base | Representation |
---|---|
bin | 100111001100010101110… |
… | …110001111110000000101 |
3 | 100112110220110212200200012 |
4 | 213030111312033300011 |
5 | 323111400111131141 |
6 | 5421142350400005 |
7 | 365404521036035 |
oct | 47142566176005 |
9 | 10473813780605 |
10 | 2693311036421 |
11 | 949254958105 |
12 | 375b94500005 |
13 | 166c93c8b6a5 |
14 | 944dd6818c5 |
15 | 4a0d4c09ceb |
hex | 27315d8fc05 |
2693311036421 has 2 divisors, whose sum is σ = 2693311036422. Its totient is φ = 2693311036420.
The previous prime is 2693311036393. The next prime is 2693311036441. The reversal of 2693311036421 is 1246301133962.
2693311036421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2674906044196 + 18404992225 = 1635514^2 + 135665^2 .
It is a cyclic number.
It is not a de Polignac number, because 2693311036421 - 230 = 2692237294597 is a prime.
It is a super-2 number, since 2×26933110364212 (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 (2693311036441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1346655518210 + 1346655518211.
It is an arithmetic number, because the mean of its divisors is an integer number (1346655518211).
Almost surely, 22693311036421 is an apocalyptic number.
It is an amenable number.
2693311036421 is a deficient number, since it is larger than the sum of its proper divisors (1).
2693311036421 is an equidigital number, since it uses as much as digits as its factorization.
2693311036421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 41.
The spelling of 2693311036421 in words is "two trillion, six hundred ninety-three billion, three hundred eleven million, thirty-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •